A \(q\)-enumeration of convex polyominoes by the festoon approach

DOI10.1016/j.tcs.2004.02.011zbMath1043.05035OpenAlexW2156615285MaRDI QIDQ596063

Svjetlan Feretić

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.011

zbMATH Keywords

Factorization\(q\)-EnumerationClosed lattice pathConvex polyominoEnclosed region

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polyominoes (05B50)

Related Items (3)

Enumeration of specific classes of polycubes ⋮ Length enumeration of fully commutative elements in finite and affine Coxeter groups ⋮ Exactly Solved Models

Cites Work

• Unnamed Item
• Unnamed Item
• Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
• \(q\)-enumeration of convex polyominoes
• The generating function of convex polyominoes: The resolution of a \(q\)- differential system
• An alternative method for \(q\)-counting directed column-convex polyominoes.
• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• Convex polyominoes and algebraic languages
• On the number of certain lattice polygons
• On the Geometry of Numbers in Elementary Number Theory

This page was built for publication: A \(q\)-enumeration of convex polyominoes by the festoon approach