Random Shadows of Fixed Polytopes
Discrete & Computational Geometry · 2026-12 · 76 (4) · 2719-2737
DOI: 10.1007/s00454-026-00880-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete & Computational Geometry, online erschienen am 31.10.2026. Verfasst von Alexander E. Black und 1 weiteren Autor:innen. Die Arbeit nennt 59 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Agencia Estatal de Investigación, National Science Foundation.
Abstract (Originalsprache)
Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool appearing in several applications through connections to linear programming and parametric optimization. We prove multiple upper bounds on the expected number of vertices of a random shadow of a fixed polytope. Our bounds are in terms of various parameters in the literature including geometric diameter and edge lengths, minimal and maximal slack, maximal coordinates for lattice polytopes, and maximum absolute values of subdeterminants. For the case of geometric diameter and edge lengths, we prove lower bounds and argue that our upper and lower bounds are both tight for zonotopes.
Förderung
- Agencia Estatal de Investigación
- National Science Foundation
Zitieren
APA
Black, A. E., & Criado, F. (2026). Random Shadows of Fixed Polytopes. Discrete & Computational Geometry, 76(4), 2719-2737. https://doi.org/10.1007/s00454-026-00880-4
Vancouver
Black AE, Criado F. Random Shadows of Fixed Polytopes. Discrete & Computational Geometry. 2026;76(4):2719-2737. doi:10.1007/s00454-026-00880-4
BibTeX
@article{Black2026,
author = {Black, Alexander E. and Criado, Francisco},
title = {Random Shadows of Fixed Polytopes},
journal = {Discrete & Computational Geometry},
year = {2026},
volume = {76},
number = {4},
pages = {2719--2737},
doi = {10.1007/s00454-026-00880-4}
}
EUVIMED