Families of \(m\)-convex polygons: \(m=1\)

DOI10.1016/j.aam.2004.08.007zbMath1066.05013WikidataQ67579096 ScholiaQ67579096MaRDI QIDQ2483914

Anthony J. Guttmann, W. R. G. James

Publication date: 1 August 2005

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2004.08.007

zbMATH Keywords

generating function; self-avoiding polygons; inclusion-exclusion principle

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

60C05: Combinatorial probability

82B41: Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics

Cites Work

• Unnamed Item
• Unnamed Item
• The number of convex polyominoes with given perimeter
• Enumeration of three-dimensional convex polygons
• Algebraic languages and polyominoes enumeration
• A new way of counting the column-convex polyominoes by perimeter
• Generating functions for column-convex polyominoes
• A method for the enumeration of various classes of column-convex polygons
• Asymptotic bounds for the number of convex \(n\)-ominoes
• Osculating and neighbour-avoiding polygons on the square lattice
• 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
• Exact solution of the staircase and row-convex polygon perimeter and area generating function
• Enumeration of Almost-Convex Polygons on the Square Lattice
• On the number of certain lattice polygons
• ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE