The centered logarithmic Brunn--Minkowski inequality

Yude Liu; Qiang Sun; Ge Xiong

Home/Archive/arXiv

arXiv · 2610.10152

The centered logarithmic Brunn--Minkowski inequality

Yude Liu·Qiang Sun·Ge Xiong

View original source ↗Read source document ↗Export metadata ↓

Abstract

The logarithmic Brunn--Minkowski and logarithmic Minkowski inequalities are proved for convex bodies whose centroids are at the origin, with equality precisely for independent positive dilations of common direct summands. This characterizes when centered convex bodies have the same cone-volume measure. The $L_p$ Brunn--Minkowski and Minkowski inequalities are also obtained for every $p>0$, with equality only for positive dilates, and the corresponding uniqueness of centered $L_p$ surface area measures is established.

Explore related subjects

math.MG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Yude Liu, Qiang Sun, Ge Xiong. 2026-10-08. The centered logarithmic Brunn--Minkowski inequality. https://arxiv.org/abs/2610.10152

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Strict concavity properties of cross covariograms

It is well-known that the cross covariogram of two convex bodies in n dimensions is 1/n-concave on its support. This paper provides conditions for strict 1/n-concavity in dimension n>1, and an analysis of how it can fail. Among the implications are that (i.) the cross covariogram of strictly convex bodies is strictly 1/n-concave, unless one body contains a translate of the other in its interior, and (ii.) the cross covariogram of an arbitrary convex body with its reflection through the origin is strictly log-concave.

math.MG↗

arXiv2026

Volume stability of plank covers

We prove a longstanding conjecture of András Bezdek on the stability of plank covers of the planar disk $D$. If a sufficiently small disk $\varepsilon D$ is removed, then every finite family of planks covering the resulting annulus can be rearranged to cover the whole disk. For the proof, we establish a stronger dimension-independent stability theorem. If $K \subset {\mathbb R}^n$ is an origin-symmetric convex body for $n \geq 2$, and the uncovered region lies in $\varepsilon K$ and has volume $v$, then the excess overlap is at least $c v/\varepsilon$, where $c>0$ is an absolute constant. The proof introduces a pruning procedure and a flattening mechanism. Pruning peels away curvature through local removals whose cumulative effect is guaranteed to be substantial. Flattening trades straightness for bounded multiplicity and geometrically exposes the overlap that pays for each pruning step.

math.MG↗

arXiv2026

The Erdős similarity problem for null sequences with adjacent ratios bounded below

Let $(a_n)$ be a positive null sequence with $\liminf_{n\to\infty}a_{n+1}/a_n>0$. For every $η>0$, we construct a compact set $E\subset[0,1]$ with Lebesgue measure greater than $1-η$ containing no nontrivial affine copy of $\{a_n:n\ge1\}$. No monotonicity is assumed. The proof adapts a finite-tree construction for geometric sequences to grids chosen from a subsequence with two-sided ratio bounds. We also obtain one such set for any prescribed countable family of sequences, with infinitely many distinct points omitted from every affine copy.

math.MG↗