Permutation polytopes and indecomposable elements in permutation groups
From MaRDI portal
Publication:855825
DOI10.1016/J.JCTA.2005.11.004zbMath1108.52014arXivmath/0503015OpenAlexW2033864528MaRDI QIDQ855825
Robert M. Guralnick, David Perkinson
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0503015
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Primitive groups (20B15)
Related Items (9)
Classification of affine symmetry groups of orbit polytopes ⋮ On permutation polytopes ⋮ A property of the Birkhoff polytope ⋮ On the diameter of partition polytopes and vertex-disjoint cycle cover ⋮ Affine symmetries of orbit polytopes ⋮ Semi-magic matrices for dihedral groups ⋮ Good Clusterings Have Large Volume ⋮ Finite groups as prescribed polytopal symmetries ⋮ Faces of Birkhoff Polytopes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometry, complexity, and combinatorics of permutation polytopes
- The polytope of even doubly stochastic matrices
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- Convex hulls of orbits of representations of finite groups and combinatorial optimization
- On the minimal degree of a primitive permutation group
- The Ehrhart polynomial of the Birkhoff polytope
- Fuchsian groups, coverings of Riemann surfaces, subgroup growth, random quotients and random walks.
- Four questions on Birkhoff polytopes
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Some subgroups of \(SI_ n(F_2)\)
- Computing group resolutions.
- On the Assignment Polytope
- The travelling salesman problem and a class of polyhedra of diameter two
- Maximal subgroups of finite groups
This page was built for publication: Permutation polytopes and indecomposable elements in permutation groups