相关论文: On tiling rectangles via the Frobenius number

We consider two number-theoretic problems arising from Fuglede's spectral set conjecture: characterizing finite sets that tile integers, and finding polynomials with (0,1) coefficients whose roots have a certain multiplicative structure. We…

We give a new proof of the following interesting fact recently proved by Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way.…

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 compute the number of rhombus tilings of a hexagon with sides $a+2,b+2,c+2,a+2,b+2,c+2$ with three fixed tiles touching the border. The particular case $a=b=c$ solves a problem posed by Propp. Our result can also be viewed as the…

A famous result of D. Walkup is that an $m\times n$ rectangle may be tiled by T-tetrominos if and only if both $m$ and $n$ are multiples of 4. The "if" portion may be proved by tiling a $4\times 4$ block, and then copying that block to fill…

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

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…

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

A tiling of the $n$-dimensional Hamming cube gives rise to a perfect code (according to a given metric) if the basic tile is a metric ball. We are concerned with metrics on the $n$-dimensional Hamming cube which are determined by a weight…

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…

Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…

We wish to tile a rectangle or a torus with only vertical and horizontal bars of a given length, such that the number of bars in every column and row equals given numbers. We present results for particular instances and for a more general…

This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…

We show that a rectangle can be signed tiled by ribbon L n-ominoes, n odd, if and only if it has a side divisible by n. A consequence of our technique, based on the exhibition of an explicit Groebner basis, is that any k-inflated copy of…

In this paper we introduce a new algebraic method in tilings. Combining this method with Hilbert's Nullstellensatz we obtain a necessary condition for tiling $n$-space by translates of a cluster of cubes. Further, the polynomial method will…

Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…

A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…

The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

All edge-to-edge tilings of the sphere by congruent regular triangles and congruent rhombi are classified as: (1) a $1$-parameter family of protosets each admitting a unique $(2a^3,3a^4)$-tiling like a triangular prism; (2) a $1$-parameter…