Metraipolis › archive › dc_783404efb280
Maximal Lehmer Codes for Permutations with Classical and Consecutive 321-Avoidance — arXiv:2609.33137
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.33137
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:29:01.680Z
- SHA-256 of the archived text
460fff5315490e9f85b202827fb4ff5085d866b6d3035c7538a09ba1299df3c5- Stable URL of this page
https://metraipolis.com/documento/dc_783404efb280
How to cite
Maximal Lehmer Codes for Permutations with Classical and Consecutive 321-Avoidance — arXiv:2609.33137 — arXiv (en), https://arxiv.org/abs/2609.33137 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_783404efb280 (Metraipolis archive dc_783404efb280, sha256 460fff5315490e9f85b202827fb4ff5085d866b6d3035c7538a09ba1299df3c5)
BibTeX
@misc{dc783404efb280,
title = {Maximal Lehmer Codes for Permutations with Classical and Consecutive 321-Avoidance — arXiv:2609.33137},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.33137},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_783404efb280; sha256 460fff5315490e9f85b202827fb4ff5085d866b6d3035c7538a09ba1299df3c5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33137. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let ${S}_n(321)$ and ${S}_n(\underline{321})$ denote the sets of $n$-permutations avoiding the classical pattern $321$ and the consecutive pattern $\underline{321}$, respectively. Permutations are in bijection with Lehmer codes, a type of inversion sequence. Using Lehmer codes, we create the corresponding weighted posets ${L}_n(321)$ and ${L}_n(\underline{321})$, where the weight of a code is the inversion number of its permutation. We show that there are $2^{n-2}$ maximal elements of ${L}_n(321)$, while the maximal elements of ${L}_n(\underline{321})$ are enumerated by the Padovan numbers. We also show that when $n$ is even, each of these posets has a unique maximum weight element, and that when $n$ is odd, there are two maximum weight elements. These maximum weight Lehmer codes correspond to the pattern avoiding permutations with maximum inversion number.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.33137 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T23:08:10.794Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).