Padrol Sureda, ArnauPhilippe, EvaSantos Leal, Francisco2024-03-072024-03-072023-07-010025-5831https://hdl.handle.net/2445/208500We 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.19 p.application/pdfengcc-by (c) Arnau Padrol et al., 2023http://creativecommons.org/licenses/by/3.0/es/PolitopsGeometria convexaPolytopesConvex geometryinfo:eu-repo/semantics/article7424742024-03-07info:eu-repo/semantics/openAccess