Many regular triangulations and many polytopes
We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n !)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an intermediate step, we show that certain neighborly polytop...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:2445/208500 |
| Acceso en línea: | https://hdl.handle.net/2445/208500 |
| Access Level: | acceso abierto |
| Palabra clave: | Politops Geometria convexa Polytopes Convex geometry |
| Sumario: | We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n !)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an intermediate step, we show that certain neighborly polytopes (such as particular realizations of cyclic polytopes) have at least $(n !)^{\lfloor(d-1) / 2\rfloor \pm o(1)}$ regular triangulations. |
|---|