OpenAlex ·
Inversion-descent enumerators of $\underline{32}1$-avoiding permutations
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2608.30266
- Original
- Read it at the publisher
- Topics
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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
Perspectives on the Bott spectral sequence for Lie groupoids
Uniform Partition-Function Estimates for Coulomb Modulated Energy at All Positive Temperatures
Density of the multidimensional Lagrange spectrum
Quantum Hopf rigidity in symmetric monoidal categories
Points of maximal traffic on a grid with obstruction
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.