Related papers: Solvable Rectangle Triangle Random Tilings
A random tiling of rectangles and triangles displaying a decagonal phase is solved by Bethe Ansatz. Analogously to the solutions of the dodecagonal square triangle and the octagonal rectangle triangle tiling an exact expression for the…
We present a detailed calculation of the recently published exact solution of a random tiling model possessing an eight-fold symmetric phase. The solution is obtained using Bethe Ansatz and provides closed expressions for the entropy and…
We consider the two-dimensional random tiling model introduced by Cockayne, i.e. the ensemble of all possible coverings of the plane without gaps or overlaps with squares and various hexagons. At the appropriate relative densities the…
Details are presented of a recently announced exact solution of a model consisting of triangular trimers covering the triangular lattice. The solution involves a coordinate Bethe Ansatz with two kinds of particles. It is similar to that of…
The exactly solvable four-vertex model on a square grid with the different boundary conditions is considered. The application of the Algebraic Bethe Ansatz method allows to calculate the partition function of the model. For the fixed…
It is shown that the square-triangle random tiling model is equivalent to an asymmetric limit of the three colouring model on the honeycomb lattice. The latter model is known to be the O(n) model at T=0 and corresponds to the integrable…
Tiling models are classical statistical models in which different geometric shapes, the tiles, are packed together such that they cover space completely. In this paper we discuss a class of two-dimensional tiling models in which the tiles…
Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…
Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…
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…
We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…
Solvable via Bethe Ansatz (BA) anisotropic statistical model on cubic lattice consisting of locally interacting 6-vertex planes, is studied. Symmetries of BA lead to infinite hierarchy of possible phases, which is further restricted by…
Classical problem of random triangle in square is solved by simple and transparent geometrical method.
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…
In the Thermodynamic Bethe Ansatz approach to 2D integrable, ADE-related quantum field theories one derives a set of algebraic functional equations (a Y-system) which play a prominent role. This set of equations is mapped into the problem…
We consider tilings of a triangle $ABC$ by congruent copies of a triangle that has one angle equal to $120^\circ$, has non-commensurable angles (that is, not all angles are rational multiples of $\pi$), and is not similar to $ABC$. We prove…
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…
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$…
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,…
A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…