Inversion polynomials for permutations avoiding consecutive patterns
DOI10.1016/j.aam.2015.03.002zbMath1314.05018arXiv1402.5211OpenAlexW2963483176MaRDI QIDQ2346477
Kendra Killpatrick, Naiomi T. Cameron
Publication date: 2 June 2015
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.5211
tableauxpermutation statisticsinversionsWilf equivalenceconsecutive patternsFibonacci tableauxgeneralized pattern avoidance
Combinatorial identities, bijective combinatorics (05A19) Binomial coefficients; factorials; (q)-identities (11B65) Combinatorial aspects of partitions of integers (05A17) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- Inversion polynomials for 321-avoiding permutations
- Permutation patterns and statistics
- Mahonian pairs
- Avoiding consecutive patterns in permutations
- Consecutive patterns in permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Multi-avoidance of generalised patterns
- Two element lattice permutation numbers and their \(q\)-generalization
- Symmetry and log-concavity results for statistics on Fibonacci tableaux
- Generalized pattern avoidance
- Unnamed Item
- Unnamed Item
This page was built for publication: Inversion polynomials for permutations avoiding consecutive patterns