Empilements de segments et q-énumération de polyominos convexes dirigés. (Heaps of segments and q-enumeration of directed convex polyominoes)

DOI10.1016/0097-3165(92)90004-EzbMATH Open0753.05023OpenAlexW2080665731MaRDI QIDQ1193571FDOQ1193571

Authors: Mireille Bousquet-Mélou, Xavier 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

Recommendations

• \(q\)-enumeration of convex polyominoes
• Combinatorics of diagonally convex directed polyominoes
• Convex polyominoes and heaps of segments
• scientific article; zbMATH DE number 4002104
• A \(q\)-enumeration of directed diagonally convex polyominoes

zbMATH Keywords

parallelogram polyominoesdirected convex polynominoesheaps of segmentsMöbius inversion theorem

Mathematics Subject Classification ID

Polyominoes (05B50)

Cites Work

• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Algebraic languages and polyominoes enumeration
• Title not available (Why is that?)
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Combinatorial problems of commutation and rearrangements
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• STACKS
• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• Coding the convex polyominoes and equations for the enumeration according to the area
• Convex n-ominoes
• On congruences and continued fractions for some classical combinatorial quantities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• Enumeration of skew Ferrers diagrams and basic Bessel functions
• Asymptotic bounds for the number of convex \(n\)-ominoes
• Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères

Cited In (27)

• Identities of the multi-variate independence polynomials from heaps theory
• Length enumeration of fully commutative elements in finite and affine Coxeter groups
• A \(q\)-enumeration of convex polyominoes by the festoon approach
• Symmetric peaks and symmetric valleys in Dyck paths
• Heaps and two exponential structures
• Coding the convex polyominoes and equations for the enumeration according to the area
• Enumeration of symmetry classes of convex polyominoes in the square lattice
• \(q\)-enumeration of convex polyominoes
• Exactly solved models
• 321-avoiding affine permutations and their many heaps
• Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères
• 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes
• Exact solution of pulled, directed vesicles with sticky walls in two dimensions
• Bounded Dyck paths, bounded alternating sequences, orthogonal polynomials, and reciprocity
• A method for the enumeration of various classes of column-convex polygons
• Convex polyominoes and heaps of segments
• Markovian dynamics of concurrent systems
• Area limit laws for symmetry classes of staircase polygons
• A \(q\)-enumeration of directed diagonally convex polyominoes
• The generating function of convex polyominoes: The resolution of a \(q\)- differential system
• Enumerative and combinatorial properties of Dyck partitions
• The sandpile model on \(K_{m,n}\) and the rank of its configurations
• Combinatorial objects enumerated by \(q\)-Bessel functions
• A bijective perimeter enumeration of directed convex polyominoes
• Enumeration of the directed convex polyominoes
• Combinatorics of non-ambiguous trees
• Why are so many problems unsolved?

This page was built for publication: Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193571)