Smooth column convex polyominoes
From MaRDI portal
Publication:2167315
Recommendations
- On column-convex and convex Carlitz polyominoes
- Polyominoes with nearly convex columns: an undirected model
- Polyominoes with nearly convex columns: a model with semidirected blocks
- Polyominoes with nearly convex columns: a semi-directed model
- Convex hulls of polyominoes
- Directed column-convex polyominoes by recurrence relations
- scientific article; zbMATH DE number 718850
- A perimeter enumeration of column-convex polyominoes
- Polymorphic Polyominoes
- Polygonal polyominoes on the square lattice
Cites work
- scientific article; zbMATH DE number 3148802 (Why is no real title available?)
- scientific article; zbMATH DE number 3897991 (Why is no real title available?)
- scientific article; zbMATH DE number 3747148 (Why is no real title available?)
- scientific article; zbMATH DE number 45409 (Why is no real title available?)
- scientific article; zbMATH DE number 1741019 (Why is no real title available?)
- scientific article; zbMATH DE number 3209177 (Why is no real title available?)
- 1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer
- A perimeter enumeration of column-convex polyominoes
- A reconstruction algorithm for L-convex polyominoes.
- Algebraic languages and polyominoes enumeration
- Analytic combinatorics
- Checker Boards and Polyominoes
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Combinatorially regular polyomino tilings
- Combinatorics of Compositions and Words
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Difference equations in statistical mechanics. I: Cluster statistics models.
- Enumerating 2D percolation series by the finite-lattice method: theory
- Enumerations of lattice animals and trees
- Exactly solved models
- Generating functions for generating trees
- Generating functions for inscribed polyominoes
- Kernel method and linear recurrence system
- On directed-convex polyominoes in a rectangle
- On translating one polyomino to tile the plane
- On two-dimensional percolation
- Packing a rectangle with congruent N-ominoes
- Random generation of \(Q\)-convex sets
- Reconstructing convex polyominoes from horizontal and vertical projections
- Smooth compositions and smooth words
- Smooth partitions and Chebyshev polynomials
- Statistics of lattice animals (polyominoes) and polygons
- The kernel method: a collection of examples
- The site-perimeter of bargraphs
- The umbral transfer-matrix method. I: Foundations
- The undecidability of the domino problem
- Tiling figures of the plane with two bars
- Up-smooth samples of geometric variables
Cited in
(8)- Enumeration of 4-stack polyominoes
- Enumeration of r-smooth words over a finite alphabet
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- Polyominoes with nearly convex columns: an undirected model
- Some large polyominoes' perimeter: a stochastic analysis
- Polyominoes with nearly convex columns: a semi-directed model
- On column-convex and convex Carlitz polyominoes
- Bijections between directed-column convex polyominoes and restricted compositions
This page was built for publication: Smooth column convex polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167315)
