Computational methods for cones and polytopes with symmetry
M. Dutour
Abstract
Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several methods which allow us to use symmetries for the computation of extreme rays and facets of cones. I give an algorithm for computing adjacencies using a linear programming approach. I give a complete description of the method of incidence, adjacency decomposition method and of the subcone method used for computing with symmetric cones.
Create a lesson
Related papers
On the geometry of real polynomials of the 7-th degree with simple complex critical points
Elizaveta Khokhlova, Yury Kochetkov
Uniqueness of the hexagonal lattice's universal optimality
Markus Faulhuber, Philipp Petersen
Hadamard configurations and sharp cubic-period bounds for stealth in dimensions 10, 11, and 12
Josiah Park
Scaling Limits and Fractal Dimensions of ω-Substitution Graph Systems
Qingcheng Zeng, Yumei Xue, Cheng Zeng
Filling Lipschitz spheres in metric spaces
Noa Vikman, Stefan Wenger
Logarithmically Slim Polygons
Panagiotis Tselekidis