McNamara–Steingrímsson interval rank-unimodality conjecture

From papers

For permutations ρ\rho and τ\tau with ρoeqτ\rho oeq \tau in the permutation pattern poset, let [ρ,τ][\rho,\tau] denote the interval of permutations u u satisfying ρoequoeqτ\rho oeq u oeq \tau, ranked by permutation length. McNamara–Steingrímsson's conjecture. Every interval in the permutation pattern poset is rank-unimodal. The conjecture extends the principal-downset question and is presented as an open problem in the source.

Progress summary

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

Sources & referencesView supporting material

Primary source

Vincent Vatter, “An assortment of problems in permutation patterns: unimodality, equivalence, derangements, and sorting”, arXiv:2602.16355 (2026).

Solutions 0

No solutions have been posted yet.