Paving of rectangles with stones of type 1 j

MaRDI QIDQ1360587zbMATH OpenFDO

Authors Eva Hiemer, Christian Korn

Publication date 17 July 1997

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/141600

zbMATH Keywords

rectangle coveringrectangle packingrecursive formulae

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Review text

Let \(R\) be an \(n\times m\) rectangle, and let a sufficiently large set \(S\) of \(1\times 1\), \(1\times 2, \dots, 1\times k\) rectangles be given \((k,m, n\in N)\). The authors ask for the number of possibilities \(f(n,m,k)\) to fill out \(R\) by ``stones from \(S\), where \(1 \times j\) stones can be used in a vertical and in a horizontal manner, and the arrangements are also considered to be different if they are identical up to rotation or reflection. A recursive formula for the general case is derived, and furthermore some special cases are discussed in detail. Finally, the authors investigate constants \(a_1,a_2, \dots\) which allow estimates of the form \(f(n,m,k) =a_k^{n \cdot m}\).

Recommendations

• On dimer coverings of rectangles of fixed width
• scientific article; zbMATH DE number 1743835
• Tiling Large Rectangles
• The number of tilings of a block with blocks
• Generating functions for straight polyomino tilings of narrow rectangles

This page was built for publication: Paving of rectangles with stones of type \(1\times j\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360587)