Rank-unimodality conjecture for principal permutation-pattern downsets

From papers

Let ρ\rho be a permutation, and let D(ρ)D(\rho) be the principal downset of all permutations contained in ρ\rho, ordered by permutation-pattern containment and ranked by permutation length. A ranked poset is rank-unimodal when its rank sizes form a unimodal sequence. Rank-unimodality conjecture for principal downsets. Every principal downset in the permutation pattern poset is rank-unimodal. This is presented as an unresolved unimodality problem; the general case remains open.

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).

Additional references

4 papers in this index state this conjecture (2013–2026). The statement above is taken from the most recent of them; the others are arXiv:2108.12979, arXiv:1403.1527, arXiv:1305.5569.

Solutions 0

No solutions have been posted yet.