On tiling rectangles via the Frobenius number

2006/05/30 by Alfonsin, J. Ramirez
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.math/0605746

Abstract

In this paper, we give some sufficient conditions for a n-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.

Related

• A note on tiling with integer-sided rectangles
• Signed shape tilings of squares
• A special tiling of the rectangle
• Minimizing the Number of Tiles in a Tiled Rectangle
• When Can You Tile an Integer Rectangle with Integer Squares?