The site-perimeter of bargraphs
From MaRDI portal
Publication:1408282
DOI10.1016/S0196-8858(02)00553-5zbMATH Open1020.05007MaRDI QIDQ1408282FDOQ1408282
Authors: Mireille Bousquet-Mélou, Andrew Rechnitzer 
Publication date: 15 September 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A method for the enumeration of various classes of column-convex polygons
- Title not available (Why is that?)
- Generating functions for generating trees
- Linear recurrences with constant coefficients: The multivariate case
- Basic analytic combinatorics of directed lattice paths
- D-finite power series
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Title not available (Why is that?)
- Lattice animals and heaps of dimers
- Title not available (Why is that?)
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Solvability of Some Statistical Mechanical Systems
- On two-dimensional percolation
- Enumeration of the directed convex polyominoes
- Statistics of collapsing lattice animals
- Indicators of solvability for lattice models
- The umbral transfer-matrix method. I: Foundations
- The number of three-choice polygons
- Enumeriation of parallelogram polyominoes with given bond and site perimeter
- Combinatorics of diagonally convex directed polyominoes
- Some problems in the counting of lattice animals, polyominoes, polygons and walks
Cited In (45)
- Exhaustive generation of gominoes
- The degree of symmetry of lattice paths
- The perimeter of uniform and geometric words: a probabilistic analysis
- Enumerations of bargraphs with respect to corner statistics
- Bargraphs of combinations with repetition
- Smooth squared, triangular and hexagonal bargraphs
- A bijection between bargraphs and Dyck paths
- Circular bargraphs
- The perimeter of words
- Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
- Prefixes of bargraph paths
- Limit distributions and scaling functions
- Title not available (Why is that?)
- Restricted bargraphs and unimodal compositions
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- Title not available (Why is that?)
- Chimneys in compositions and bargraphs
- Impulse propagation in compositions and words
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
- The number of directed \(k\)-convex polyominoes
- Polyominoes with minimum site-perimeter and full set achievement games
- The site-perimeter of words
- Exact solutions of lattice polymer models
- Bargraphs in bargraphs
- Skew Dyck paths, area, and superdiagonal bargraphs
- The height and width of bargraphs
- The perimeter of 2-compositions
- \(t\)-bargraphs and \(t\)-compositions
- Tight bounds for connecting sites across barriers
- Measuring symmetry in lattice paths and partitions
- Enumerations on bargraphs
- Combinatorial parameters in bargraphs
- Partially directed snake polyominoes
- Smooth column convex polyominoes
- Semi-perimeter and inner site-perimeter of \(k\)-ary words and bargraphs
- The site-perimeter of permutations
- On the tiling system recognizability of various classes of convex polyominoes
- Statistics on bargraphs viewed as cornerless Motzkin paths
- The anisotropic generating function of self-avoiding polygons is not D-finite
- The site-perimeter of compositions
- The perimeter and site-perimeter of set partitions
- Title not available (Why is that?)
- Saturated fully leafed tree-like polyforms and polycubes
- The inner site-perimeter of compositions
- Polycubes with small perimeter defect
Uses Software
This page was built for publication: The site-perimeter of bargraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408282)
