2008/05/30 by Sultan Hussain, Usman Ali, Hussain, Sultan +1
Computer Science · Engineering · Materials Science · #Cellular Automata and Applications #FOS: Mathematics #History and Overview (math.HO) #Quasicrystal Structures and Properties #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.0805.4679
openalex publication_date 2008/05/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating the condition on the borders of the tiles. Consequently this strategy leads to yet another solution to the famous rectangle tiling theorem.