Smooth convex polyiamonds
From MaRDI portal
Cites work
- 1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer
- Algebraic languages and polyominoes enumeration
- An improved lower bound on the growth constant of polyiamonds
- Checker Boards and Polyominoes
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Combinatorially regular polyomino tilings
- Counting of descents in a bargraph and barpolyiamond
- Difference equations in statistical mechanics. I: Cluster statistics models.
- Enumerating 2D percolation series by the finite-lattice method: theory
- Enumeration of various animals on the triangular lattice
- Exactly solved models
- Generating functions for generating trees
- 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?)
- On Carlitz compositions
- On translating one polyomino to tile the plane
- On two-dimensional percolation
- Smooth column convex polyominoes
- Smooth squared, triangular and hexagonal bargraphs
- The undecidability of the domino problem
- Tiling figures of the plane with two bars
This page was built for publication: Smooth convex polyiamonds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6870121)
