A method for the enumeration of various classes of column-convex polygons

DOI10.1016/0012-365X(95)00003-FMaRDI QIDQ1918535zbMATH OpenDBLPWikidataFDO

Authors Mireille Bousquet-Mélou

Publication date 23 March 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(95)00003-F

zbMATH Keywords

column-convex polygonenumerationgenerating functionsquare lattice

Mathematics Subject Classification ID

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

Review text

This method involves building up a column-convex polygon on the plane square lattice by considering the various possible ways in which another column can be added. The author calls this process the ``Temperley methodology (referring to the reviewers paper [Phys. Review, II. Ser. 103, 1-16 (1956; Zbl 0075.20502)]) and applies it to finding the generating function for various special types of column-convex polygons.

Recommendations

• Two generalizations of column-convex polygons
• A new way of counting the column-convex polyominoes by perimeter
• A perimeter enumeration of column-convex polyominoes
• An alternative method for \(q\)-counting directed column-convex polyominoes.
• Generating functions for column-convex polyominoes

Cites work

• A new way of counting the column-convex polyominoes by perimeter
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Algebraic languages and polyominoes enumeration
• Asymptotic bounds for the number of convex \(n\)-ominoes
• Coding the convex polyominoes and equations for the enumeration according to the area
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• Directed column-convex polyominoes by recurrence relations
• Empilements de segments et q-énumération de polyominos convexes dirigés. (Heaps of segments and q-enumeration of directed convex polyominoes)
• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• Exact results for the generating function of directed column-convex animals on the square lattice
• Exact solution of the row-convex polygon perimeter generating function
• Exact solution of the staircase and row-convex polygon perimeter and area generating function
• Generating functions for column-convex polyominoes
• scientific article; zbMATH DE number 3209177 (Why is no real title available?)
• New enumerative results on two-dimensional directed animals
• The generating function of convex polyominoes: The resolution of a \(q\)- differential system
• The self-avoiding walk.

Cited in

(84)

• Exact solutions of lattice polymer models
• Enumeration of symmetry classes of convex polyominoes in the square lattice
• Enumeration of three-dimensional convex polygons
• Some combinatorial interpretations of q-analogs of Schröder numbers
• Inversion relations, reciprocity and polyominoes
• Q-grammars and wall polyominoes
• A bijective perimeter enumeration of directed convex polyominoes
• Lattice paths: Vicious walkers and friendly walkers
• A methodology for plane tree enumeration
• A new way of counting the column-convex polyominoes by perimeter
• Haruspicy and anisotropic generating functions
• The site-perimeter of bargraphs
• Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
• From Tetris to polyominoes generation
• Periodic parallelogram polyominoes
• Length enumeration of fully commutative elements in finite and affine Coxeter groups
• Exchange relations, Dyck paths and copolymer adsorption
• From object grammars to ECO systems
• A combinatorial method for the enumeration of column-convex polyominoes
• The perimeter of words
• Large deviations of convex polyominoes
• The perimeter generating function for nondirected diagonally convex polyominoes
• Partially directed animals with a bounded number of holes
• On the generation of convex polyominoes
• The number of directed \(k\)-convex polyominoes
• Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
• Combinatorial aspects of \(L\)-convex polyominoes
• Partially directed paths in a wedge
• Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons
• Families of \(m\)-convex polygons: \(m=1\)
• Polynomial equations with one catalytic variable, algebraic series and map enumeration
• Random generation of \(Q\)-convex sets
• Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice
• Geometric properties of matrices induced by pattern avoidance
• Enumeration of various animals on the triangular lattice
• Distributive lattice polyhedra
• The medians of discrete sets
• Permutation classes and polyomino classes with excluded submatrices
• Area limit laws for symmetry classes of staircase polygons
• Recognizable Picture Languages and Polyominoes
• Exactly solved models
• The anisotropic generating function of self-avoiding polygons is not D-finite
• Exact enumerations
• Limit distributions and scaling functions
• Two generalizations of column-convex polygons
• Exhaustive generation of gominoes
• Enumeration of 4-stack polyominoes
• Solving multivariate functional equations
• Enumeration of specific classes of polycubes
• Polyominoes determined by permutations: enumeration via bijections
• Succession rules and Deco polyominoes
• Automated counting of lego towers
• ECO:a methodology for the enumeration of combinatorial objects
• On computing the degree of convexity of polyominoes
• Fully commutative elements in finite and affine Coxeter groups
• Some large polyominoes' perimeter: a stochastic analysis
• Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
• The site-perimeter of words
• A Dynamical System Approach to Polyominoes Generation*
• On the exhaustive generation of \(k\)-convex polyominoes
• Enumerations on bargraphs
• A perimeter enumeration of column-convex polyominoes
• An algorithm for deciding if a polyomino tiles the plane
• A construction for enumerating k-coloured Motzkin paths
• Region selection in Markov random fields: Gaussian case
• The enumeration of prudent polygons by area and its unusual asymptotics
• Smooth squared, triangular and hexagonal bargraphs
• Enumeration of plateau polycubes with respect to their lateral area
• On the tiling system recognizability of various classes of convex polyominoes
• Restricted bargraphs and unimodal compositions
• A polyominoes-permutations injection and tree-like convex polyominoes
• Combinatorial exploration: an algorithmic framework for enumeration
• Enumeration of parallelogram polycubes
• Efficient counting of k-convex polyominoes
• Centered ascending polyominoes
• Water capacity of baryiamonds
• Asymptotic behavior of inflated lattice polygons
• Exact solution of two classes of prudent polygons
• The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
• The number of three-choice polygons
• Combinatorics and physics. Dedicated to the memory of Claude Itzykson. Papers from the Conference on Physics and Combinatorics held in Marseille, March 27--31, 1995
• The enumeration of fully commutative affine permutations
• Counting elements and geodesics in Thompson's group \(F\).
• On \(q\)-functional equations and excursion moments

This page was built for publication: A method for the enumeration of various classes of column-convex polygons

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