Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Pan, Qiongqiong
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7204869814
