The site-perimeter of bargraphs
From MaRDI portal
Publication:1408282
DOI10.1016/S0196-8858(02)00553-5zbMath1020.05007MaRDI QIDQ1408282
Mireille Bousquet-Mélou, Andrew Rechnitzer
Publication date: 15 September 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Related Items
The degree of symmetry of lattice paths, Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite, A bijection between bargraphs and Dyck paths, Unnamed Item, Smooth column convex polyominoes, Unnamed Item, Exhaustive generation of gominoes, Chimneys in compositions and bargraphs, Partially directed snake polyominoes, Unnamed Item, Measuring symmetry in lattice paths and partitions, Unnamed Item, Saturated fully leafed tree-like polyforms and polycubes, Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees, The height and width of bargraphs, On the tiling system recognizability of various classes of convex polyominoes, Polyominoes with minimum site-perimeter and full set achievement games, The Perimeter of 2-Compositions, Semi-perimeter and inner site-perimeter of k-ary words and bargraphs, Statistics on bargraphs viewed as cornerless Motzkin paths, Circular bargraphs, Bargraphs in bargraphs, The perimeter of words, Skew Dyck paths, area, and superdiagonal bargraphs, Impulse propagation in compositions and words, The number of directed \(k\)-convex polyominoes, The site-perimeter of words, The inner site-perimeter of compositions, The perimeter of uniform and geometric words: a probabilistic analysis, Exact solutions of lattice polymer models, t-bargraphs and t-compositions, Combinatorial parameters in bargraphs, The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite, Limit Distributions and Scaling Functions, Enumerations of bargraphs with respect to corner statistics, The site-perimeter of compositions, Polycubes with small perimeter defect
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-finite power series
- The number of three-choice polygons
- Enumeriation of parallelogram polyominoes with given bond and site perimeter
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- Generating functions for generating trees
- The umbral transfer-matrix method. I: Foundations
- Linear recurrences with constant coefficients: The multivariate case
- Basic analytic combinatorics of directed lattice paths
- Lattice animals and heaps of dimers
- A method for the enumeration of various classes of column-convex polygons
- Enumeration of the directed convex polyominoes
- Combinatorics of diagonally convex directed polyominoes
- Indicators of solvability for lattice models
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Solvability of Some Statistical Mechanical Systems
- Some problems in the counting of lattice animals, polyominoes, polygons and walks
- Statistics of collapsing lattice animals
- On two-dimensional percolation
