Rook and Wilf equivalence of integer partitions
From MaRDI portal
Publication:1750226
DOI10.1016/j.ejc.2018.04.002zbMath1387.05014arXiv1808.04238OpenAlexW2802550759MaRDI QIDQ1750226
Publication date: 18 May 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.04238
Related Items (3)
On criteria for rook equivalence of Ferrers boards ⋮ Rook and Wilf equivalence of integer partitions ⋮ Counting pattern-avoiding integer partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bijections on \(m\)-level rook placements
- Patterns in permutations and words.
- Bijective proofs of some classical partition identities
- Rook and Wilf equivalence of integer partitions
- On \(abab\)-free and \(abba\)-free set partitions
- Pattern avoidance in matchings and partitions
- \(m\)-level rook placements
- \(m\)-rook numbers and a generalization of a formula of Frobenius to \(C_m \wr \mathcal S_n\)
- The problem of the rooks and its applications
- Pattern avoidance for set partitions \`a la Klazar
- Combinatorics of Permutations
- Rook Theory. I.: Rook Equivalence of Ferrers Boards
This page was built for publication: Rook and Wilf equivalence of integer partitions