Many regular triangulations and many polytopes

From MaRDI portal
Publication:6404033




Abstract: We show that for fixed d>3 and n growing to infinity there are at least (n!)d2pmo(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(d1)/2floorpmo(1) regular triangulations.









This page was built for publication: Many regular triangulations and many polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404033)