Exact formulas for 2 × n arrays of dumbbells
From MaRDI portal
Publication:4401460
DOI10.1063/1.1666624zbMATH Open0276.05008OpenAlexW2095559642MaRDI QIDQ4401460FDOQ4401460
Authors: Roger C. Grimson
Publication date: 1974
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.1666624
Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of tessellation and tiling problems (05B45)
Cites Work
Cited In (6)
- The number of tilings of a block with blocks
- A generalized Binet formula that counts the tilings of a \(2\times N\)-board
- The occupation statistics for variously shaped particles on a rectangular 2×N lattice space
- The dimer problem for narrow rectangular arrays: A unified method of solution, and some extensions
- Enumeration of dimer (domino) configurations
- King and domino polynomials for polyomino graphs
This page was built for publication: Exact formulas for 2 × n arrays of dumbbells
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401460)