Polycubes with small perimeter defect
From MaRDI portal
Publication:2093266
DOI10.1007/s00026-022-00601-7zbMath1503.05084OpenAlexW4296270211MaRDI QIDQ2093266
Gill Barequet, Andrei Asinowski, Yufei Zheng
Publication date: 7 November 2022
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-022-00601-7
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Polyominoes (05B50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formulae and growth rates of high-dimensional polycubes
- Counting polyominoes: yet another attack
- A pattern theorem for lattice clusters
- The site-perimeter of bargraphs
- Enumerating polyominoes with fixed perimeter defect
- The impact of large-scale computing on lattice statistics.
- Automatic generation of formulae for polyominoes with a fixed perimeter defect
- Counting \(n\)-cell polycubes proper in \(n - k\) dimensions
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- The free energy of a collapsing branched polymer
- The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite
- Counting multidimensional polyominoes
- The Perimeter of Proper Polycubes
- On two-dimensional percolation
- COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
- Cell Growth Problems
- Improved upper bounds on the growth constants of polyominoes and polycubes
- Enumerations of lattice animals and trees
This page was built for publication: Polycubes with small perimeter defect
