Polyominoes determined by permutations: enumeration via bijections
From MaRDI portal
Publication:434225
DOI10.1007/S00026-011-0121-6zbMath1244.05014OpenAlexW2015104084MaRDI QIDQ434225
Simone Rinaldi, Enrica Duchi, Filippo Disanto, Renzo Pinzani
Publication date: 10 July 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-011-0121-6
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Polyominoes (05B50)
Related Items (1)
Cites Work
- Unnamed Item
- Permutation diagrams, fixed points and Kazhdan-Lusztig \(R\)-polynomials
- The number of convex permutominoes
- A closed formula for the number of convex permutominoes
- The singular locus of a Schubert variety
- A method for the enumeration of various classes of column-convex polygons
- Permutations defining convex permutominoes
This page was built for publication: Polyominoes determined by permutations: enumeration via bijections