Dissection of a rectangle into rectangles with given side ratios
Fyodor Sharov

TL;DR
This paper characterizes all rectangles that can be tiled by a set of given rectangles with quadratic irrational side ratios, providing a comprehensive understanding of such tilings and their constraints.
Contribution
It offers a complete classification of rectangles tileable by similar rectangles with quadratic irrational ratios, extending previous partial results.
Findings
Provides explicit conditions for tiling possibilities
Classifies all rectangles that can be tiled by given quadratic irrational rectangles
Extends tiling theory to include quadratic irrational side ratios
Abstract
Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used several times or not used at all, so that the number of rectangles in the tiling is not necessarily equal to N.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Matrix Theory and Algorithms · Iterative Methods for Nonlinear Equations
