Equivalence of Lattice Orbit Polytopes
DOI10.1137/17M1120130zbMath1486.52027arXiv1703.01152MaRDI QIDQ4564021
Frieder Ladisch, Achill Schürmann
Publication date: 12 June 2018
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.01152
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Ordinary representations and characters (20C15) Integral representations of finite groups (20C10) Units, groups of units (associative rings and algebras) (16U60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orbital branching
- Packing and partitioning orbitopes
- Constructing units in commutative group rings
- Exploiting orbits in symmetric ILP
- A computational comparison of symmetry handling methods for mixed integer programs
- Units of classical orders: A survey
- Algorithms for highly symmetric linear and integer programs
- On lattice-free orbit polytopes
- Computing in arithmetic groups with Voronoï's algorithm.
- Computing generators of the unit group of an integral Abelian group ring.
- Polytopes associated with symmetry handling
- Exploiting symmetry in integer convex optimization using core points
- Classification of orthogonal arrays by integer programming
- Computing symmetry groups of polyhedra
- Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
- Integer Programming with a Fixed Number of Variables
- Orbital Shrinking
- Symmetry in Integer Linear Programming
- Fundamental Domains for Integer Programs with Symmetries
- Permutation representations and rational irreducibility
- Generic units in abelian group rings
- Bounding the rank of certain permutation groups