PreprintarXiv licencearXiv
Inversion-descent enumerators of underline321-avoiding permutations
Abstract
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.
Related
- Descent Tops and Pinnacles on 2143- and 3421-Avoiding Permutations
- Residual structure and growing inversion-monotonicity regions for 1324-avoiding permutations
- Avoiding patterns with three distinct letters in Canon permutations
- Shuffle automata and the growth of 1324-avoiding permutations
- The Distribution of Double Deficiencies in Pattern-Avoiding Permutations
BibTeX
@misc{pan2026inversiondescent,
title = {{Inversion-descent enumerators of $\underline321$-avoiding permutations}},
author = {Qiongqiong Pan},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.30266},
eprint = {2608.30266},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.30266},
}
RIS
TY - UNPB
TI - Inversion-descent enumerators of underline321-avoiding permutations
AU - Qiongqiong Pan
PY - 2026
DA - 2026/08/31
PB - arXiv
DO - 10.48550/arxiv.2608.30266
UR - https://arxiv.org/abs/2608.30266
AB - 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.
ER -