Metraipolis › archive › dc_ad43fc68549d
Inversion-descent enumerators of $\underline{32}1$-avoiding permutations — arXiv:2608.30266
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30266
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T09:31:09.785Z
- SHA-256 of the archived text
2cf5624dee85734411d3e1734f0185197eca4e6af2c65f93b76bd1d0007db248- Stable URL of this page
https://metraipolis.com/documento/dc_ad43fc68549d
How to cite
Inversion-descent enumerators of $\underline{32}1$-avoiding permutations — arXiv:2608.30266 — arXiv (en), https://arxiv.org/abs/2608.30266 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ad43fc68549d (Metraipolis archive dc_ad43fc68549d, sha256 2cf5624dee85734411d3e1734f0185197eca4e6af2c65f93b76bd1d0007db248)
BibTeX
@misc{dcad43fc68549d,
title = {Inversion-descent enumerators of $underline321$-avoiding permutations — arXiv:2608.30266},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30266},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ad43fc68549d; sha256 2cf5624dee85734411d3e1734f0185197eca4e6af2c65f93b76bd1d0007db248},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30266. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give the recurrence relation for counting polynomials for permutations avoiding the $\321$ vincular pattern, with respect to inversion numbers and descent numbers, and consequently give the $q$-exponential generating function for these counting polynomials. Furthermore, we give another explanation for these counting polynomials in terms of restricted-growth words. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.30266 — 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-17T09:02:28.848Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).