Convex Near-Extremizers for the Multidimensional Hermite-Hadamard Inequality

Larson proved that the boundary-mean Hermite-Hadamard inequality on bounded convex domains in R^n has sharp constant n for nonnegative subharmonic functions. We construct explicit nonnegative convex near-extremizers on collapsing simplices, proving that restricting the test functions to the convex class does not improve this universal constant. The construction uses the positive part of an affine function, with its localization scale larger than the collapsing thickness. We calculate the exact ratio and a quantitative error bound, and show that the same supremum holds for smooth, strictly positive, strictly convex test functions. This resolves the boundary-mean convex subproblem in AIM Shape optimization with surface interactions, Problem 6.1, corresponding to AIM-ANALYSIS-0032 in UnsolvedMath v1.6.0. Neither volume-power normalized sharp constant is determined here; the whole four-constant record remains partial. The all-dimensional proof is supplemented by 4,072 exact arithmetic regression checks. This is an unrefereed preprint; no independent review, formal verification or absolute-priority claim is asserted.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-15
DOI
https://doi.org/10.5281/zenodo.23403202
Primary Topic
Mathematical Inequalities and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Convex Near-Extremizers for the Multidimensional Hermite-Hadamard Inequality

Alper Ferudun
Zenodo (CERN European Organization for Nuclear Research)
Mathematical Inequalities and Applications
preprint

Convex Near-Extremizers for the Multidimensional Hermite-Hadamard Inequality

Alper Ferudun
preprint en

Abstract

Larson proved that the boundary-mean Hermite-Hadamard inequality on bounded convex domains in R^n has sharp constant n for nonnegative subharmonic functions. We construct explicit nonnegative convex near-extremizers on collapsing simplices, proving that restricting the test functions to the convex class does not improve this universal constant. The construction uses the positive part of an affine function, with its localization scale larger than the collapsing thickness. We calculate the exact ratio and a quantitative error bound, and show that the same supremum holds for smooth, strictly positive, strictly convex test functions. This resolves the boundary-mean convex subproblem in AIM Shape optimization with surface interactions, Problem 6.1, corresponding to AIM-ANALYSIS-0032 in UnsolvedMath v1.6.0. Neither volume-power normalized sharp constant is determined here; the whole four-constant record remains partial. The all-dimensional proof is supplemented by 4,072 exact arithmetic regression checks. This is an unrefereed preprint; no independent review, formal verification or absolute-priority claim is asserted.

Zenodo (CERN European Organization for Nuclear Research)
Mathematical Inequalities and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.