To access the full text documents, please follow this link:

Exploiting symmetry on the Universal Polytope
Pfeifle, Julián
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II; Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
The most successful method to date for finding lower bounds on the number of simplices needed to triangulate a given polytope P involves optimizing a linear functional over the associated Universal Polytope U(P). However, as the dimension of P grows, these linear programs become increasingly difficult to formulate and solve. Here we present a method to algorithmically construct the quotient of U(P) by the symmetry group Aut(P) of P, which leads to dramatic reductions in the size of the linear program. We compare the power of our approach with older computations by Orden and Santos, indicate the influence of the combinatorial complexity barrier on these computations, and sketch some future applications.
Peer Reviewed
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria convexa i discreta
Discrete geometry
Geometria discreta
52B Polytopes and polyhedra
52C Geometria discreta
Attribution-NonCommercial-NoDerivs 3.0 Spain

Show full item record

Related documents

Other documents of the same author

Ardila, Federico; Beck, Matthias; Hosten, Serkan; Pfeifle, Julián; Seashore, Kim
Muntés Mulero, Víctor; Padrol Sureda, Arnau; Perarnau Llobet, Guillem; Pfeifle, Julián
Pfeifle, Julián; Ziegler, Günter M.