Metraipolis › archive › dc_571d0245ef28
Gaussian Vertex-Face Balance in Random Convex Polyhedra with Fixed Edge Count — arXiv:2609.22402
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22402
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:44:37.073Z
- SHA-256 of the archived text
05bff8fa40cb635f0241519b3d04af3f6667325e04da0682d3012873fe9ef196- Stable URL of this page
https://metraipolis.com/documento/dc_571d0245ef28
How to cite
Gaussian Vertex-Face Balance in Random Convex Polyhedra with Fixed Edge Count — arXiv:2609.22402 — arXiv (en), https://arxiv.org/abs/2609.22402 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_571d0245ef28 (Metraipolis archive dc_571d0245ef28, sha256 05bff8fa40cb635f0241519b3d04af3f6667325e04da0682d3012873fe9ef196)
BibTeX
@misc{dc571d0245ef28,
title = {Gaussian Vertex-Face Balance in Random Convex Polyhedra with Fixed Edge Count — arXiv:2609.22402},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22402},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_571d0245ef28; sha256 05bff8fa40cb635f0241519b3d04af3f6667325e04da0682d3012873fe9ef196},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22402. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Choose uniformly among the combinatorial types of convex three-dimensional polyhedra with a fixed admissible number $e$ of edges, and let $V_e$ be the number of vertices. This resolves a fixed-edge limit-distribution question posed by Rüdinger: if $\beta_e=V_e/(e+2)$, then $\sqrt e(\beta_e-1/2)\Rightarrow N(0,1/32)$, equivalently $\operatorname{Var}(V_e)\sim e/32$. Using the classical rooted enumeration and asymmetry results of Bender and Wormald, we derive a relative lattice local limit theorem on every $o(e^{3/4})$ window, a quartic correction from the rate function on every $o(e^{5/6})$ window, precise moderate-tail constants, a quadratic moderate-deviation principle for every $a_e\to\infty$ with $a_e=o(\sqrt e)$, and a full speed-$e$ large-deviation principle with an explicit good rate function. All fixed standardised moments converge. When $e=3m$, the two extremal vertex counts have equal probability asymptotic to $\frac{6561}{32\sqrt2}(4/27)^m$. Rooted and unrooted fixed-edge laws are also uniformly exponentially close, with relative discrepancy $O(\rho^e)$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.22402 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T21:26:41.089Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).