\(q\)-enumeration of convex polyominoes
From MaRDI portal
Publication:1318368
DOI10.1016/0097-3165(93)90098-SzbMath0793.05003MaRDI QIDQ1318368
Publication date: 7 June 1994
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items
Combinatorial objects enumerated by \(q\)-Bessel functions, The generating function of convex polyominoes: The resolution of a \(q\)- differential system, Two combinatorial statistics on Dyck paths, ``Deco polyominoes, permutations and random generation, A \(q\)-enumeration of convex polyominoes by the festoon approach, Counting walks by their last erased self-avoiding polygons using sieves, Counting acyclic digraphs by sources and sinks, Self-avoiding walks, the language of science, and Fibonacci numbers, Stacking models of vesicles and compact clusters, On the Bessel functions, Acyclic orientations and the chromatic polynomial, Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions, \(q\)-enumeration of convex polyominoes
Cites Work
- Unnamed Item
- Unnamed Item
- An undecidable problem about rational sets and contour words of polyominoes
- Polyominoes which tile rectangles
- 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
- Algebraic languages and polyominoes enumeration
- Tiling with polyominoes and combinatorial group theory
- Generating functions for column-convex polyominoes
- Asymptotic bounds for the number of convex \(n\)-ominoes
- Combinatorial problems of commutation and rearrangements
- Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères
- Tiling with sets of polyominoes
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
