11 problems
Haase's face-subgroup conjecture. If and is a face, then there is a partition
Let be pairwise coprime integers, and let be the permutation polytope associated with three disjoint cycles of lengths , , and . Facet-count co…
Let be the cyclic permutation group of order , acting with orbits, and for let denote the relevant order associated with the unio…
Stabilizer characterization conjecture. If is a face, then
Wedge conjecture. The wedge over can be combinatorially realized as a face of a permutation polytope if, or only if, the complement of in is a face of .
Free-sum conjecture. The free sum of centrally symmetric faces of permutation polytopes can be combinatorially realized as a face of a permutation polytope.
Affine-automorphism conjecture. If
Birkhoff-polytope uniqueness conjecture. If is combinatorially equivalent to for some , then is effectively equivalent to .
Stable-degree conjecture. There exists a stably equivalent permutation representation such that
Strong embedding conjecture. There exists a permutation group such that is combinatorially equivalent, or more strongly lattice equivalent, to .
Nonexistence conjecture. There are no four-dimensional faces of permutation polytopes having the combinatorial type of or .