相关论文: Tiling Parity Results and the Holey Square Solutio…
In this paper we consider arbitrary hexagons on the triangular lattice with three arbitrary bowtie-shaped holes, whose centers form an equilateral triangle. The number of lozenge tilings of such general regions is not expected --- and…
A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container $P$. We give…
Let T(m,n) denote the number of ways to tile an m-by-n rectangle with dominos. For any fixed m, the numbers T(m,n) satisfy a linear recurrence relation, and so may be extrapolated to negative values of n; these extrapolated values satisfy…
There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the areas of which are bounded from below by a positive constant.…
We study domino tilings of certain regions $R_\lambda$, indexed by partitions $\lambda$, weighted according to generalized area and dinv statistics. These statistics arise from the $q,t$-Catalan combinatorics and Macdonald polynomials. We…
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…
Fairly shortly after the publication of the Aztec diamond theorem of Elkies, Kuperberg, Larsen and Propp in 1992, interest arose in finding the number of domino tilings of an Aztec diamond with an ``Aztec window,'' i.e.\ a hole in the shape…
We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values…
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…
The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…
We present and prove closed form expressions for some families of binomial determinants with signed Kronecker deltas that are located along an arbitrary diagonal in the corresponding matrix. They count cyclically symmetric rhombus tilings…
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…
We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. The techniques employed in our proof include a different orientation for simulating the Wang…
A tiling of a topological disc by topological discs is called monohedral if all tiles are congruent. Maltby (J. Combin. Theory Ser. A 66: 40-52, 1994) characterized the monohedral tilings of a square by three topological discs. Kurusa,…
In a region R consisting of unit squares, a (domino) tiling is a collection of dominoes (the union of two adjacent squares) which pave fully the region. The flip graph of R is defined on the set of all tilings of R where two tilings are…
P. Di Francesco first introduced the "Aztec triangle" in his study of the relationship between the twenty-vertex model and domino tilings. He conjectured an exact formula for the number of tilings of the Aztec triangle, and it has since…
An \emph{auspicious tatami mat arrangement} is a tiling of a rectilinear region with two types of tiles, $1 \times 2$ tiles (dimers) and $1 \times 1$ tiles (monomers). The tiles must cover the region and satisfy the constraint that no four…
Let T be a tile in the Cartesian plane made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be…
This paper gives new solutions to the problem: 'Can we construct monohedral tilings of the disk such that a neighbourhood of the origin has trivial intersection with at least one tile?'
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.