Permutation polytopes of cyclic groups
From MaRDI portal
Abstract: We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the situation that the generator of the group consists of at most two orbits, we can give a complete combinatorial description of the associated permutation polytope. In the case of three orbits the facet structure is already quite complex. For a large class of examples we show that there exist exponentially many facets.
Recommendations
Cited in
(18)- Combinatorics of polytopes with a group of linear symmetries of prime power order
- Arbitrary group permutations on hypercube and nonblocability of cube-connected cycles
- Cyclic group blocking polyhedra
- Digital convex + unimodular mapping = 8-connected (all points but one 4-connected)
- An algebra over the operad of posets and structural binomial identities
- On lattice-free orbit polytopes
- On permutation polytopes: notions of equivalence
- On volumes of permutation polytopes
- Polytopes associated to dihedral groups
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Cyclopermutohedron: geometry and topology
- The equivariant volumes of the permutahedron
- Groups of piecewise isometric permutations of lattice points, or Finitary rearrangements of tessellations
- Geometry, complexity, and combinatorics of permutation polytopes
- Permutations over cyclic groups
- On permutation polytopes
- Permutation polytopes and indecomposable elements in permutation groups
- Representations of cyclic groups acting on complete simplicial fans
This page was built for publication: Permutation polytopes of cyclic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377396)