Tiling n X m rectangles with 1 X 1 and s X s squares

2016/09/13 by Mathar, Richard J. · 1 citation
#05B45 (Secondary) #52C20 (Primary) #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1609.03964

Abstract

We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths n as a function of the parameter m and of the number of s X s squares in the rectangle.

Cited by

• Independent Set Enumeration in King Graphs by Tensor Network Contractions

Related

• Generating functions for straight polyomino tilings of narrow rectangles
• Tilings of Rectangular Regions by Rectangular Tiles: Counts Derived from Transfer Matrices
• Tiling of rectangles with squares via Diophantine approximation
• A special tiling of the rectangle
• Tiling a rectangle with the fewest squares