On the Enumeration of Permutominoes

DOI10.1007/978-3-319-22177-9_4zbMath1434.68750OpenAlexW2139235912MaRDI QIDQ2947868

Ana Paula Tomás

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle/11441/60029

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Grammars and rewriting systems (68Q42) Polyominoes (05B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About half permutations
• An alternative proof of the rectilinear art gallery theorem
• Permutation diagrams, fixed points and Kazhdan-Lusztig \(R\)-polynomials
• The number of convex permutominoes
• A closed formula for the number of convex permutominoes
• Coding the convex polyominoes and equations for the enumeration according to the area
• Enumerating symmetric directed convex polyominoes
• On the generation and enumeration of some classes of convex polyominoes
• Generating random polygons with given vertices
• Connecting polygonizations via stretches and twangs
• On the complexity of Jensen's algorithm for counting fixed polyominoes
• On the exhaustive generation of convex permutominoes
• On rectangular visibility
• ECO:a methodology for the enumeration of combinatorial objects
• Computational Science and Its Applications – ICCSA 2004
• Enumerations of lattice animals and trees

This page was built for publication: On the Enumeration of Permutominoes