Related papers: Tiling a rectangle with the fewest squares

We will show that for $q<p$ there exists an $\al < \infty$ such that \[ \pi_{pq}(T) \pl \le c_{pq} \pi_{pq}^{[n^{\alpha}]}(T) \mbox{for all $T$ of rank $n$.}\] Such a polynomial number is only possible if $q=2$ or $q<p$. Furthermore, the…

A flat torus is the quotient of the Euclidean plane over a lattice generated by a basis, and an axis-aligned rectangular tiling of a flat torus is a partition into finitely many rectangles whose sides are axis-aligned. We provide the…

An $N$-tiling of triangle $ABC$ by triangle $T$ (the `tile') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(\alpha,\beta,\gamma)$, and sides $(a,b,c)$. This…

We identify least-perimeter unit-area tilings of the plane by convex pentagons, namely tilings by Cairo and Prismatic pentagons, find infinitely many, and prove that they minimize perimeter among tilings by convex polygons with at most five…

We will show that the number of integers $\leq x$ that can be written as the square of an integer plus the square of a prime equals $\frac{\pi}{2} \cdot \frac {x}{\log x}$ minus a secondary term of size $x/(\log x)^{ 1+\delta+o(1)}$, where…

The tilings of the 2-dimensional sphere by congruent triangles have been extensively studied, and the edge-to-edge tilings have been completely classified. However, not much is known about the tilings by other congruent polygons. In this…

We show that for any relatively prime integers $1\leq p<q$ and for any finite $A \subset \mathbb{Z}$ one has $$|p \cdot A + q \cdot A | \geq (p + q) |A| - (pq)^{(p+q-3)(p+q) + 1}.$$

A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…

The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…

We say that a triangle $T$ tiles a polygon $A$, if $A$ can be dissected into finitely many nonoverlapping triangles similar to $T$. We show that if $N>42$, then there are at most three nonsimilar triangles $T$ such that the angles of $T$…

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

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…

We give a constructive method that can decrease the number of prototiles needed to tile a space. We achieve this by exchanging edge to edge matching rules for a small atlas of permitted patches. This method is illustrated with Wang tiles,…

An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…

We give an exact formula for the number of distinct square patterns of a given size that occur in the Squiral tiling.

Let $p$ be a prime number, $p=2^nq+1$, where $q$ is odd. D. Shanks described an algorithm to compute square roots $\pmod{p}$ which needs $O(\log q + n^2)$ modular multiplications. In this note we describe two modifications of this…

Let the columns of a $p \times q$ matrix $M$ over any ring be partitioned into $n$ blocks, $M = [M_1, ..., M_n]$. If no $p \times p$ submatrix of $M$ with columns from distinct blocks $M_i$ is invertible, then there is an invertible $p…

A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…

A method is described for constructing, with computer assistance, planar substitution tilings that have n-fold rotational symmetry. This method uses as prototiles the set of rhombs with angles that are integer multiples of pi/n, and…

We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…