A relation between the shape of a permutation and the shape of the base poset derived from the Lehmer codes
Masaya Tomie

TL;DR
This paper explores the relationship between permutation shapes and the structure of associated posets derived from Lehmer codes, revealing a characterization of certain permutation classes via poset properties.
Contribution
It establishes a precise equivalence between 3412-3421-avoiding permutations and the $B_2$-free property of the related posets, linking permutation patterns to poset structure.
Findings
$M_{\omega}$ is $B_2$-free iff $\omega$ avoids 3412 and 3421 patterns
Characterization of permutation classes via poset properties
Connection between permutation pattern avoidance and poset structure
Abstract
For a permutation Denoncourt constructed a poset which is the set of join-irreducibles of the Lehmer codes of the permutations in in the inversion order on . In this paper we show that is a -free poset if and only if is a 3412-3421-avoiding permutation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · graph theory and CDMA systems · Coding theory and cryptography
