Restricted Lego towers
From MaRDI portal
Recommendations
Cites work
- A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
- Algebraic languages and polyominoes enumeration
- Automated counting of lego towers
- Checker Boards and Polyominoes
- Code for polyomino and computer search of isospectral polyominoes
- Combinatorial parameters in bargraphs
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Contributions to the Cell Growth Problem
- Counting corners in compositions and set partitions presented as bargraphs
- Exact solution of the discrete (1+1)-dimensional RSOS model in a slit with field and wall interactions
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- Exact solution of the row-convex polygon perimeter generating function
- Extremal polyomino chains on k-matchings and k-independent sets
- Generating functions for inscribed polyominoes
- Gröbner bases of balanced polyominoes
- History and introduction to polygon models and polyominoes
- scientific article; zbMATH DE number 3754699 (Why is no real title available?)
- scientific article; zbMATH DE number 718850 (Why is no real title available?)
- scientific article; zbMATH DE number 1741019 (Why is no real title available?)
- Ideals generated by 2-minors, collections of cells and stack polyominoes
- On the tiling system recognizability of various classes of convex polyominoes
- Packing polyominoes clumsily
- Recognizable Picture Languages and Polyominoes
- Rectangular polyomino set weak (1,2)-achievement games
- Simple polyominoes are prime
- The PI index of polyomino chains of \(4k\)-cycles
- Tiling the Plane with a Fixed Number of Polyominoes
Cited in
(5)
This page was built for publication: Restricted Lego towers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988159)