The number of convex permutominoes
From MaRDI portal
Publication:948075
DOI10.1016/J.IC.2008.03.009zbMATH Open1160.05013OpenAlexW1979222036MaRDI QIDQ948075FDOQ948075
Authors: Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini 
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2434/48896
Recommendations
Cites Work
- Algebraic languages and polyominoes enumeration
- Title not available (Why is that?)
- Title not available (Why is that?)
- A closed formula for the number of convex permutominoes
- The singular locus of a Schubert variety
- Permutation diagrams, fixed points and Kazhdan-Lusztig \(R\)-polynomials
- Ordered trees with prescribed root degrees, node degrees, and branch lengths
- Polyominoes determined by permutations
- On the combinatorial invariance of Kazhdan--Lusztig polynomials
- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids
Cited In (9)
- A closed formula for the number of convex permutominoes
- About half permutations
- Polyominoes determined by permutations: enumeration via bijections
- The number of convex polyominoes with given perimeter
- The combinatorics of convex permutominoes
- On the exhaustive generation of convex permutominoes
- On the enumeration of permutominoes
- Reconstructing convex permutominoes
- Permutations defining convex permutominoes
This page was built for publication: The number of convex permutominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948075)
