Face-lattice conjecture for partial permutohedra

Let P(m,n)\mathcal{P}(m,n) be the partial permutohedron and let Bm\mathcal{B}_m be the Boolean lattice of subsets of [m][m]. For a chain in Bm\mathcal{B}_m, the difference between its largest and smallest nonempty subsets means the difference of their ranks. Face-lattice conjecture. Faces of P(m,n)\mathcal{P}(m,n) are in bijection with chains in Bm\mathcal{B}_m whose difference between largest and smallest nonempty subsets is at most n1n-1. A face of P(m,n)\mathcal{P}(m,n) has dimension kk if and only if the corresponding chain has kk missing ranks. This conjecture extends the established characterization for P(m,m)\mathcal{P}(m,m) and proposes a corresponding description when mnm\ne n.

Sources & referencesView supporting material

Primary source

Dylan Heuer and Jessica Striker, “Partial permutation and alternating sign matrix polytopes”, arXiv:2012.09901 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.