Rank-unimodality conjecture for composition and layered-permutation downsets
Rank-unimodality conjecture for composition and layered-permutation downsets
Let be a composition, ordered by the subword order, and let its principal downset consist of all compositions contained in . A composition is associated with a layered permutation by replacing its parts with decreasing blocks. Composition and layered-permutation conjecture. The principal downset of every composition is rank-unimodal in the subword order. Hence, the principal downset of every layered permutation is rank-unimodal. The claim is stated as an intriguing open problem; only compositions with monotone parts are covered by the result discussed immediately before it.
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
Sign in to submit a solution.
No solutions have been posted yet.