Generating functions for straight polyomino tilings of narrow rectangles
From MaRDI portal
Abstract: Let be fixed positive integers. Determining the generating function for the number of tilings of an rectangle by rectangles is a long-standing open problem to which the answer is only known in certain special cases. We give an explicit formula for this generating function in the case where . This result is used to obtain the generating function for the number of tilings of an box with bricks.
Recommendations
Cites work
- A note on the occupational degeneracy for dimers on a saturated two- dimensional lattice space
- Analytic combinatorics
- Dimer problem in statistical mechanics-an exact result
- Domino tilings of rectangles with fixed width
- Filling Boxes with Bricks
- scientific article; zbMATH DE number 3664976 (Why is no real title available?)
- On dimer coverings of rectangles of fixed width
- Packing a rectangle with congruent N-ominoes
- Polynomials and packings: A new proof of de Bruijn's theorem
- When can you tile a box with translates of two given rectangular bricks?
Cited in
(3)
This page was built for publication: Generating functions for straight polyomino tilings of narrow rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060316)