Recommendations
Cites work
- A method for the enumeration of various classes of column-convex polygons
- Basic analytic combinatorics of directed lattice paths
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Combinatorics of diagonally convex directed polyominoes
- Critical exponents from nonlinear functional equations for partially directed cluster models
- D-finite power series
- Enumeration of the directed convex polyominoes
- 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
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- scientific article; zbMATH DE number 195103 (Why is no real title available?)
- scientific article; zbMATH DE number 3209177 (Why is no real title available?)
- Indicators of solvability for lattice models
- Lattice animals and heaps of dimers
- Linear recurrences with constant coefficients: The multivariate case
- On two-dimensional percolation
- Solvability of Some Statistical Mechanical Systems
- Some problems in the counting of lattice animals, polyominoes, polygons and walks
- Statistics of collapsing lattice animals
- The number of three-choice polygons
- The umbral transfer-matrix method. I: Foundations
Cited in
(47)- Exact solutions of lattice polymer models
- A bijection between bargraphs and Dyck paths
- Partially directed snake polyominoes
- Saturated fully leafed tree-like polyforms and polycubes
- Circular bargraphs
- The perimeter of words
- Impulse propagation in compositions and words
- The site-perimeter of compositions
- Polycubes with small perimeter defect
- Smooth column convex polyominoes
- Measuring symmetry in lattice paths and partitions
- Skew Dyck paths, area, and superdiagonal bargraphs
- The number of directed \(k\)-convex polyominoes
- Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
- The perimeter and site-perimeter of set partitions
- Polyominoes with minimum site-perimeter and full set achievement games
- The anisotropic generating function of self-avoiding polygons is not D-finite
- Limit distributions and scaling functions
- Exhaustive generation of gominoes
- The height and width of bargraphs
- \(t\)-bargraphs and \(t\)-compositions
- Enumerations of bargraphs with respect to corner statistics
- scientific article; zbMATH DE number 7379065 (Why is no real title available?)
- Statistics on bargraphs viewed as cornerless Motzkin paths
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- The site-perimeter of words
- The perimeter of 2-compositions
- Semi-perimeter and inner site-perimeter of k-ary words and bargraphs
- Enumerations on bargraphs
- The inner site-perimeter of compositions
- scientific article; zbMATH DE number 7090168
- The perimeter of uniform and geometric words: a probabilistic analysis
- Combinatorial parameters in bargraphs
- The site-perimeter of permutations
- Bargraphs in bargraphs
- Counting border edges in bargraphs
- Chimneys in compositions and bargraphs
- Bargraphs of combinations with repetition
- Smooth squared, triangular and hexagonal bargraphs
- Prefixes of bargraph paths
- On the tiling system recognizability of various classes of convex polyominoes
- Restricted bargraphs and unimodal compositions
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
- The combinatorics of Motzkin polyominoes
- Title not available (Why is no real title available?)
- The degree of symmetry of lattice paths
- Tight bounds for connecting sites across barriers
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)
