Indexed metadata

Many Facets in Random Polytopes from Product and Log-Concave Measures

Silouanos Brazitikos, Minas Pafis

Source record

Source: arXiv

Published: Aug 27, 2026

arXiv: 2608.26692

Open original source ↗

Source abstract

We prove bounds of order nn/2eO(n)n^{n/2}e^{O(n)} for the expected number of facets of high-dimensional random polytopes. First, let μμ be a non-degenerate compactly supported even probability measure on R\R satisfying μ([x∗−s,x∗])≍sκμ([x^\ast-s,x^\ast])\asymp s^κ near its right endpoint x∗x^\ast. For every sufficiently small fixed α>0α>0, the convex hull of N=⌊eαn⌋N=\lfloor e^{αn}\rfloor independent points with law μ⊗nμ^{\otimes n} has at least nn/2e−Cμ,αnn^{n/2}e^{-C_{μ,α}n} expected facets; this includes all symmetric finite-alphabet distributions. For every full-dimensional log-concave probability measure on Rn\R^n, we prove that there exist T∈[n,2n]T\in[n,2n] and N=⌈eTn3/2⌉N=\lceil e^Tn^{3/2}\rceil for which nn/2e−Cn≤Efn−1(PN)≤nn/2eCn. n^{n/2}e^{-Cn} \leq \mathbb E f_{n-1}(P_N) \leq n^{n/2}e^{Cn}. Thus the scale nn/2n^{n/2}, up to exponential factors, is universal for log-concave measures in this high-dimensional exponential regime. Finally, we construct a symmetric isotropic full-support non-log-concave counterexample with only (1+o(1))2n(1+o(1))2^n expected facets.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.