Refined Wilf-equivalences by Comtet statistics
From MaRDI portal
Publication:2055135
DOI10.3934/ERA.2021018zbMath1484.05007arXiv2009.04269OpenAlexW3136030873MaRDI QIDQ2055135
Zhicong Lin, Shishuo Fu, Ya-Ling Wang
Publication date: 3 December 2021
Published in: Electronic Research Archive (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.04269
Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\gamma\)-positive polynomials arising in pattern avoidance
- Permutation patterns and statistics
- Bijections for refined restricted permutations
- Patterns in permutations and words.
- On two unimodal descent polynomials
- The descent statistic on 123-avoiding permutations
- Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
- The number of Baxter permutations
- Forbidden subsequences
- Block decomposition of permutations and Schur-positivity
- A sextuple equidistribution arising in pattern avoidance
- An involution on Dyck paths that preserves the rise composition and interchanges the number of returns and the position of the first double fall
- Generating trees and the Catalan and Schröder numbers
- Bijective proofs of recurrences involving two Schröder triangles
- Gamma-positivity in combinatorics and geometry
- The Eulerian distribution on involutions is indeed \(\gamma\)-positive
- Théorie géométrique des polynômes eulériens
- Patterns in Inversion Sequences I
- $k$-Arrangements, Statistics, and Patterns
- Eulerian Numbers
- On pattern avoiding indecomposable permutations
- Restricted permutations
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- Permutations with restricted patterns and Dyck paths
This page was built for publication: Refined Wilf-equivalences by Comtet statistics
