EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Sharp Poincaré–Wirtinger inequalities on complete graphs

Cristian González-Riquelme, José Madrid

Annales Fennici Mathematici · 10.03.2026 · 51 (1) · 163-175

DOI: 10.54330/afm.180669 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Annales Fennici Mathematici, online erschienen am 10.03.2026. Verfasst von Cristian González-Riquelme und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let \(K_n=(V,E)\) be the complete graph with \(n\geq 3\) vertices (here \(V\) and \(E\) denote the set of vertices and edges of \(K_n\) respectively). We find the optimal value \({\bf{C}}_{n,p}\) such that the inequality \(\|f-m_f\|_p\le {\bf C}_{n,p}\operatorname{var}_{p}f\) holds for every \(f\colon V\to \mathbb{R},\) where \(\operatorname{var}_p\) stands for the \(p\)-variation, and \(m_f\) stands for the average value of \(f\), for all \(p\in[1,3+\delta^1_n)\cup (3+\delta^2_n,+\infty)\), for \(\delta^1_n=\frac{1}{2n^2\log(n)}+O(1/n^3)\) and \(\delta^2_n=\frac{2}{n}+O(1/n^2)\). Moreover, we characterize all the maximizer functions in that case. The behavior of the maximizers is different in each of the intervals \((1,2)\), \((2,3+\delta^{1}_n)\) and \((3+\delta^{2}_n,\infty)\).

Zitieren

APA

González-Riquelme, C., & Madrid, J. (2026). Sharp Poincaré–Wirtinger inequalities on complete graphs. Annales Fennici Mathematici, 51(1), 163-175. https://doi.org/10.54330/afm.180669

Vancouver

González-Riquelme C, Madrid J. Sharp Poincaré–Wirtinger inequalities on complete graphs. Annales Fennici Mathematici. 2026;51(1):163-175. doi:10.54330/afm.180669

BibTeX
@article{GonzlezRiquelme2026,
  author = {González-Riquelme, Cristian and Madrid, José},
  title = {Sharp Poincaré–Wirtinger inequalities on complete graphs},
  journal = {Annales Fennici Mathematici},
  year = {2026},
  volume = {51},
  number = {1},
  pages = {163--175},
  doi = {10.54330/afm.180669}
}
Kostenlos starten →