Random convergence of generalized Steiner processes

Christian Kipp; Ádám Sagmeister

Home/Archive/arXiv

arXiv · 2610.05113

Random convergence of generalized Steiner processes

Christian Kipp·Ádám Sagmeister

View original source ↗Read source document ↗Export metadata ↓

Abstract

It is well-known that a random Steiner process converges almost surely to a Euclidean ball. On the other hand, as we show in this article, a planar random shaking process converges almost surely to a triangle (in the Banach-Mazur distance). Asking whether these phenomena are generic or exceptional, we study random iterations of an operation called $λ$-Steiner symmetrization, which includes Steiner symmetrization and shaking as special cases. We establish abstract criteria for almost sure convergence and divergence of such processes, obtaining criteria for many other symmetrization operations from convex geometry as a byproduct. Based on a joint characterization of ellipses and triangles, we give a full resolution to our question in the planar case.

Explore related subjects

math.MG math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Christian Kipp, Ádám Sagmeister. 2026-10-04. Random convergence of generalized Steiner processes. https://arxiv.org/abs/2610.05113

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

KEEP EXPLORING

Related papers

arXiv2026

Optimal mean width and metric entropy estimates for convex bodies

We show that for any $n \geq 1$ and any convex body $K \subset \mathbf{R}^n$, there exists $T \in \mathrm{SL}(n)$ such that \[ \mathrm{diam}(TK) \lesssim \sqrt{n} \mathrm{vr}(K), \quad \mbox{and} \quad M^\ast\Big(T(K-x) \cap r\mathrm{vr}(K)\,B^n_2\Big)\lesssim \mathrm{vr}(K) \sqrt{\log(\mathrm{e} r^2)}, \] for every $x \in K$ and every $r \geq 1$. Above, $M^\ast(\cdot)$ denotes the spherical mean width and $\mathrm{vr}(\cdot)$ denotes the volume radius. As a consequence, we establish for any convex body $K \subset \mathbf{R}^n$ that \[ 1 \leq \inf_{T \in \mathrm{SL}(n)} \, \frac{M^\ast(TK)}{\mathrm{vr}(K)} \lesssim \sqrt{\log(\mathrm{e} n)}. \] The estimates above are sharp, up to universal constants, as they are attained for the crosspolytope and any regular $n$-simplex. Up to universal constants, our results show that all quermassintegrals, and the logarithm of the covering numbers for all scales, simultaneously for $K$ and the polar body $K^\circ$, are maximized by the simplex and crosspolytope. Our proof makes use of Eldan's stochastic localization. To establish the results, we work with an extension of Bobkov's maximal Gaussian measure position to possibly non-symmetric convex bodies. Our results imply that this position is an optimal "regular" Milman position, thereby improving a result of G. Pisier. We establish a non-symmetric analogue of the strong Gaussian (B)-theorem which may be of independent interest.

math.MG↗

arXiv2026

Non-convex unit-edge polytopes on kissing configurations in dimensions 5-7

All nine known conjecturally optimal non-lattice kissing configurations in dimensions 5, 6, and 7 are the vertex sets of polytopes with only unit edges. Eight of these polytopes are non-convex, and the contact polytopes, the convex hulls of the same points, have longer edges. The edges of the unit-edge polytopes are exactly the contacts of the configuration. All but two of the nine are constructed from the lattice contact polytope in the same dimension by splitting some of its facets and reassembling the pieces. This describes the configurations by the facets of a polytope rather than by layers. The facets that fold when split are consecutive members of the Gosset series $k_{21}$, and a split in dimension $n$ folds to the inner product $1/(10-n)$: $1/5$, $1/4$, or $1/3$. These are the inner products by which the contact polytopes differ from the lattice one. In dimensions 5 and 6 each unit-edge polytope is the only one on its vertex set. In dimension 7 uniqueness is proved within a class we define, the creased polytopes, which extends convexity by letting a facet lie on a hyperplane that cuts through the configuration, provided the facet contains every vertex on that hyperplane on its side of one of its ridges. Every statement is certified in exact arithmetic.

math.MG↗

arXiv2026

On solid angles and simplex shape measures

The minimum solid angle of a simplex is shown to be a shape measure in any dimension. While this has been known in dimensions two and three, the higher-dimensional generalization is new. We prove inequalities between the minimum solid angle of a non-degenerate simplex and its fullness. Up to dimension-dependent constants, the fullness is bounded from above by the minimum solid angle and from below by the square of the minimum solid angle. The exponents are optimal for three and higher dimensions. This work therefore generalizes the minimum angle condition. We also review several simplex shape measures and their relationships.

math.MG↗