Related papers: Shield tilings
A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.
We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which all dihedral angles are less than $77.08^\circ$, and another…
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…
In this paper we enumerate the centrally symmetric lozenge tilings of a hexagon with a fern removed from its center. The proof is based on a variant of Kuo's graphical condensation method. An unexpected connection with the total number of…
A grid method using tiling by fundamental domain of simple 2D lattices is presented. It refer to a previous work done by Stampfli in $1986$ using two tilings by regular hexagons, one rotate by $\pi/2$ relatively to the other. This allows to…
We study $C^1$-regular surfaces in $R^3$ that admit tilings by a finite number of rigid motion congruence classes of tiles. We construct examples with various topologies and present a framework for a systematic study, mainly concentrating…
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…
This paper proves the following results: Besides parallelograms and centrally symmetric hexagons, there is no other convex domain which can form a two-, three- or four-fold lattice tiling in the Euclidean plane. If a centrally symmetric…
We determine asymptotically the two extremal constructions for the tiling problem of the $H$-shaped tree. In particular, the first extremal construction is close to the complement of two cliques, in contrast to previously studied bipartite…
We prove that for every $N\ne 4$ there is only one right triangle that tiles the regular $N$-gon.
We consider here square tilings of the plane. By extending the formalism introduced in [3] we build a correspondence between plane maps endowed with an harmonic vector and square tilings satisfying a condition of regularity. In the case of…
We consider right prisms with horizontal quadrilateral bases and tops, and vertical rectangular sides. We look for examples where all the edges, face diagonals and space diagonals are integers. We find examples when the base is an isosceles…
We study properties of certain circles associated with a triangle. Each circle is inside the triangle, tangent to two sides of the triangle, and externally tangent to the arc of a circle erected internally on the third side.
We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined by their Tutte polynomial, showing as an example how to apply this technique to the toroidal hexagonal tiling.
In the article "Construction of the discrete hull for the combinatorics of a regular pentagonal tiling of the plane" we gave the construction of a discrete hull for a combinatorial pentagonal tiling of the plane. In this paper, we give the…
We discuss the finiteness of (two-term) silting objects. First, we investigate new triangulated categories without silting object. Second, one studies two classes of $\tau$-tilting-finite algebras and give the numbers of their two-term…
The number of complete tilings of m X n floors for tiles of shape 1 X 2, 1 X 3, 1 X 4 and 2 X 3 is computed numerically for floors up to width m=9 and variable floor lengths n. Counts are obtained for two classes, for fixed tile stack…
If every vertex in a map has one out of two face-cycle types, then the map is said to be $2$-semiequivelar. A 2-uniform tiling is an edge-to-edge tiling of regular polygons having $2$ distinct transitivity classes of vertices. Clearly, a…
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…