Related papers: Covering of a rectangle by squares

Let a polygon be composed of equal rectangles. We find all quadratic irrationals r for which the polygon can be tiled by similar rectangles with given side ratio r.

The paper provides an elementary proof of Kenyon's necessary condition for the existence of a periodic tiling of the plane by squares with given periods. A similar new result on covering both sides of a rectangle by nonoverlaping squares is…

In the present popular science paper we determine when a square can be dissected into rectangles similar to a given rectangle. The approach to the question is based on a physical interpretation using electrical networks. Only secondary…

We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…

We study when an arrangement of axis-aligned rectangles can be transformed into an arrangement of axis-aligned squares in $\mathbb{R}^2$ while preserving its structure. We found a counterexample to the conjecture of J. Klawitter, M.…

Let $S$ be a set of $n$ points in the unit square $[0,1]^2$, one of which is the origin. We construct $n$ pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in $S$, and the…

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

Question when rectangle can be tiled with similar copies of rectangles witch quetient of sides quadratic irrationalities. New proof of one part F. Sharov's theorem. Other close result.

We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.

This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible…

We consider cylinders in ${\cal H}^2\times R$ (see definitions in the introduction) and prove that a complete and connected surface in ${\cal H}^2\times R$ with the vanishing of the Gauss and extrinsic curvatures is a cylinder.

We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.

A well known open problem of Meir and Moser asks if the squares of sidelength $1/n$ for $n \geq 2$ can be packed perfectly into a square of area $\sum_{n=2}^\infty \frac{1}{n^2} = \frac{\pi^2}{6}-1$. In this paper we show that for any $1/2…

Everybody knows from school how to solve a quadratic equation of the form $x^2-px+q=0$ graphically. But this method can become tedious if several equations ought to be solved, as for each pair $(p,q)$ a new parabola has to be drawn.…

We consider the problem of characterizing upper-triangular matrices $M=\begin{pmatrix}p&r\\0&q\end{pmatrix}\in M_2(\mathbb Z)$ which can be represented in the form $A^2-B^2$ with upper-triangular integer matrices $A$ and $B$ and give a…

Consider a set $P$ of $n$ points on the boundary of an axis-aligned square $Q$. We study the boundary-anchored packing problem on $P$ in which the goal is to find a set of interior-disjoint axis-aligned rectangles in $Q$ such that each…

In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, R\'emila showed that for simply connected regions by two rectangles, the…

Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…

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…

In the present popular-science paper, we find out which rectangles can be dissected into squares. The proof is based on a physical interpretation in terms of electrical networks. Only a secondary school background is assumed in the paper.