Tiling Rectangles and the Plane using Squares of Integral Sides

by   Bahram Sadeghi Bigham, et al.

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given, and one has to decide whether it can tile the plane or a rectangle or not. Previously, it has been proved that tiling the plane is not feasible using a set of odd numbers or an infinite sequence of natural numbers including exactly two odd numbers. The problem is open for different situations in which the number of odd numbers is arbitrary. In addition to providing a solution to this special case, we discuss some open problems to tile the plane and rectangles in this paper.


page 1

page 2

page 3

page 4


Sommerfeld type integrals for discrete diffraction problems

Three discrete problems for Helmholtz equation is studied analytically u...

Numerical solution to stress distribution of a hole with corners on infinite plane

In this paper, we consider the stress of a hole with the given fourfold ...

Condition numbers of the mixed least squares-total least squares problem: revisited

A new closed formula for the first order perturbation estimate of the mi...

A linear algorithm for Brick Wang tiling

The Wang tiling is a classical problem in combinatorics. A major theoret...

Super-resolving star clusters with sheaves

This article explains an optimization-based approach for counting and lo...

A contribution to condition numbers of the multidimensional total least squares problem with linear equality constraint

This paper is devoted to condition numbers of the multidimensional total...

Computations with p-adic numbers

This document contains the notes of a lecture I gave at the "Journées Na...