Geometry, complexity, and combinatorics of permutation polytopes
DOI10.1016/0097-3165(93)90086-NzbMATH Open0789.05095MaRDI QIDQ690026FDOQ690026
Authors: Shmuel Onn 
Publication date: 2 December 1993
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Recommendations
partitionspermutation polytopepermutation matricessymmetric grouporiented matroidstability numberbistochastic matricestraveling salesman polytopecomputational complexitiesorbit polytopeYoung polytopes
Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of representation theory (05E10) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Stochastic matrices (15B51) Modular representations and characters (20C20)
Cites Work
- Title not available (Why is that?)
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- Title not available (Why is that?)
- The representation theory of the symmetric groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the diameter of convex polytopes
- The Hirsch conjecture is true for (0,1)-polytopes
- Title not available (Why is that?)
- Hamiltonicity in (0-1)-polyhedra
- Fiber polytopes
- On the Assignment Polytope
- Convexity in oriented matroids
- Results and problems in the theory of doubly-stochastic matrices
- An Inequality
- Convex hulls of orbits of representations of finite groups and combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- The travelling salesman problem and a class of polyhedra of diameter two
- The adjacency relation on the traveling salesman polytope is NP-Complete
Cited In (34)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- Title not available (Why is that?)
- Polytopes of roots of type AN
- Pattern-avoiding polytopes
- On permutation polytopes
- Permutation polytopes and indecomposable elements in permutation groups
- Polytopes, permutation shapes and bin packing
- Title not available (Why is that?)
- Convex hulls of orbits of representations of finite groups and combinatorial optimization
- ORBITOPES
- Describing orbitopes by linear inequalities and projection based tools.
- Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
- Classification of affine symmetry groups of orbit polytopes
- A property of the Birkhoff polytope
- Exploiting symmetry in integer convex optimization using core points
- The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes
- \(k\)-neighborly faces of the Boolean quadric polytopes
- Title not available (Why is that?)
- Geometric permutations for convex sets
- Inscribed Tverberg‐type partitions for orbit polytopes
- An effective solution to convex 1-body \(N\)-representability
- Determination of social laws for multi-agent mobilization
- Two graph isomorphism polytopes
- Affine symmetries of orbit polytopes
- Hilbert series of group representations and Gröbner bases for generic modules
- Good clusterings have large volume
- The geometry of sum-preserving permutations
- Permutohedra and minimal matrices
- Linear-shaped partition problems
- Title not available (Why is that?)
- Faces of Birkhoff Polytopes
- Title not available (Why is that?)
- On permutation polytopes: notions of equivalence
- Correlation polytopes: Their geometry and complexity
This page was built for publication: Geometry, complexity, and combinatorics of permutation polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690026)
