A method for the enumeration of various classes of column-convex polygons
From MaRDI portal
Publication:1918535
DOI10.1016/0012-365X(95)00003-FzbMath0858.05006WikidataQ56874209 ScholiaQ56874209MaRDI QIDQ1918535
Publication date: 23 March 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Geometric properties of matrices induced by pattern avoidance, Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite, From object grammars to ECO systems, The medians of discrete sets, Combinatorial aspects of \(L\)-convex polyominoes, A bijective perimeter enumeration of directed convex polyominoes, Lattice paths: Vicious walkers and friendly walkers, Unnamed Item, Enumeration of various animals on the triangular lattice, A methodology for plane tree enumeration, A new way of counting the column-convex polyominoes by perimeter, Exhaustive generation of gominoes, Enumeration of 4-stack polyominoes, Solving multivariate functional equations, Enumeration of specific classes of polycubes, From Tetris to polyominoes generation, Periodic parallelogram polyominoes, A construction for enumerating k-coloured Motzkin paths, Haruspicy and anisotropic generating functions, Region selection in Markov random fields: Gaussian case, Partially directed paths in a wedge, The site-perimeter of bargraphs, Polyominoes determined by permutations: enumeration via bijections, Permutation classes and polyomino classes with excluded submatrices, Recognizable Picture Languages and Polyominoes, The enumeration of prudent polygons by area and its unusual asymptotics, Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons, The perimeter generating function for nondirected diagonally convex polyominoes, Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees, Asymptotic behavior of inflated lattice polygons, On the tiling system recognizability of various classes of convex polyominoes, A polyominoes-permutations injection and tree-like convex polyominoes, On computing the degree of convexity of polyominoes, Partially directed animals with a bounded number of holes, Fully commutative elements in finite and affine Coxeter groups, On the exhaustive generation of \(k\)-convex polyominoes, A Dynamical System Approach to Polyominoes Generation*, On the generation of convex polyominoes, Exact solution of two classes of prudent polygons, Families of \(m\)-convex polygons: \(m=1\), The average height of directed column-convex polyominoes having square, hexagonal and triangular cells, 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 perimeter of words, The enumeration of fully commutative affine permutations, Polynomial equations with one catalytic variable, algebraic series and map enumeration, Counting elements and geodesics in Thompson's group \(F\)., Some large polyominoe's perimeter: a stochastic analysis, An algorithm for deciding if a polyomino tiles the plane, Area Limit Laws for Symmetry Classes of Staircase Polygons, Length enumeration of fully commutative elements in finite and affine Coxeter groups, On \(q\)-functional equations and excursion moments, The number of directed \(k\)-convex polyominoes, The site-perimeter of words, Automated counting of lego towers, ECO:a methodology for the enumeration of combinatorial objects, Enumeration of symmetry classes of convex polyominoes in the square lattice, Exact solutions of lattice polymer models, Exactly Solved Models, The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite, Limit Distributions and Scaling Functions, Exchange relations, Dyck paths and copolymer adsorption, Enumeration of three-dimensional convex polygons, Large deviations of convex polyominoes, Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions, Distributive Lattice Polyhedra, Succession rules and Deco polyominoes, Random generation of \(Q\)-convex sets, Some combinatorial interpretations of \(q\)-analogs of Schröder numbers, Inversion relations, reciprocity and polyominoes, \(Q\)-grammars and wall polyominoes, Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice
Cites Work
- Unnamed Item
- The self-avoiding walk.
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
- Coding the convex polyominoes and equations for the enumeration according to the area
- The generating function of convex polyominoes: The resolution of a \(q\)- differential system
- Algebraic languages and polyominoes enumeration
- New enumerative results on two-dimensional directed animals
- A new way of counting the column-convex polyominoes by perimeter
- Generating functions for column-convex polyominoes
- Asymptotic bounds for the number of convex \(n\)-ominoes
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Exact solution of the row-convex polygon perimeter generating function
- Exact solution of the staircase and row-convex polygon perimeter and area generating function
- Exact results for the generating function of directed column-convex animals on the square lattice
- Directed column-convex polyominoes by recurrence relations
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
