Exactly Solved Models
From MaRDI portal
Publication:3651680
DOI10.1007/978-1-4020-9927-4_3zbMath1226.05020MaRDI QIDQ3651680
Mireille Bousquet-Mélou, Richard Brak
Publication date: 11 December 2009
Published in: Polygons, Polyominoes and Polycubes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4020-9927-4_3
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees, Some large polyominoe's perimeter: a stochastic analysis, On self-avoiding polygons and walks: The snake method via pattern fluctuation, Combinatorial parameters in bargraphs, Synergistic development of differential approximants and the finite lattice method in lattice statistics, Solving multivariate functional equations, The height and width of bargraphs, Statistics on bargraphs viewed as cornerless Motzkin paths, The enumeration of prudent polygons by area and its unusual asymptotics, Fighting fish: enumerative properties, An upper bound on the number of self-avoiding polygons via joining, Smooth column convex polyominoes, The perimeter and site-perimeter of set partitions, On self-avoiding polygons and walks: the snake method via polygon joining, Fighting fish
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A \(q\)-enumeration of convex polyominoes by the festoon approach
- Directed animals and gas models revisited
- Binary search networks: A new method for key searching
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
- Enumeration of three-dimensional convex polygons
- Coding the convex polyominoes and equations for the enumeration according to the area
- Generating functions for generating trees
- Algebraic languages and polyominoes enumeration
- New enumerative results on two-dimensional directed animals
- A new way of counting the column-convex polyominoes by perimeter
- Linear recurrences with constant coefficients: The multivariate case
- Basic analytic combinatorics of directed lattice paths
- The kernel method: a collection of examples
- Generating functions for column-convex polyominoes
- Convex n-ominoes
- Lattice animals and heaps of dimers
- On the number of hexagonal polyominoes
- An object grammar for column-convex polyominoes
- Exact scaling behavior of partially convex vesicles
- A method for the enumeration of various classes of column-convex polygons
- An alternative method for \(q\)-counting directed column-convex polyominoes.
- On the area of square lattice polygons.
- Asymptotic bounds for the number of convex \(n\)-ominoes
- Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
- Critical exponents from nonlinear functional equations for partially directed cluster models
- A solution to the tennis ball problem
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Contributions to the Cell Growth Problem
- Random self-avoiding walks on one-dimensional lattices
- Exact solution of the staircase and row-convex polygon perimeter and area generating function
- On the number of certain lattice polygons
- Statistics of lattice animals (polyominoes) and polygons
- Self-avoiding polygons on the square lattice
- Rational and algebraic series in combinatorial enumeration
- Cell Growth Problems
- The umbral transfer-matrix method. III: Counting animals
