Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
From MaRDI portal
Publication:1193571
DOI10.1016/0097-3165(92)90004-EzbMath0753.05023OpenAlexW2080665731MaRDI QIDQ1193571
Mireille Bousquet-Mélou, Xavier G. Viennot
Publication date: 27 September 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(92)90004-e
Related Items
Combinatorial objects enumerated by \(q\)-Bessel functions, 321-avoiding affine permutations and their many heaps, The generating function of convex polyominoes: The resolution of a \(q\)- differential system, A bijective perimeter enumeration of directed convex polyominoes, A \(q\)-enumeration of convex polyominoes by the festoon approach, A method for the enumeration of various classes of column-convex polygons, Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères, Markovian dynamics of concurrent systems, Enumeration of the directed convex polyominoes, Combinatorics of non-ambiguous trees, 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes, Exact solution of pulled, directed vesicles with sticky walls in two dimensions, Symmetric peaks and symmetric valleys in Dyck paths, Area Limit Laws for Symmetry Classes of Staircase Polygons, Length enumeration of fully commutative elements in finite and affine Coxeter groups, The sandpile model on \(K_{m,n}\) and the rank of its configurations, Enumeration of symmetry classes of convex polyominoes in the square lattice, Exactly Solved Models, Why Are So Many Problems Unsolved?, Coding the convex polyominoes and equations for the enumeration according to the area, \(q\)-enumeration of convex polyominoes, Enumerative and combinatorial properties of Dyck partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- On congruences and continued fractions for some classical combinatorial quantities
- Enumeration of skew Ferrers diagrams and basic Bessel functions
- Coding the convex polyominoes and equations for the enumeration according to the area
- Algebraic languages and polyominoes enumeration
- Convex n-ominoes
- Asymptotic bounds for the number of convex \(n\)-ominoes
- Combinatorial problems of commutation and rearrangements
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
- Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères
- STACKS
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
