Related papers: Hexagonal Tiling of the Plane
In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…
The translational tiling problem, dated back to Wang's domino problem in the 1960s, is one of the most representative undecidable problems in the field of discrete geometry and combinatorics. Ollinger initiated the study of the…
For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…
A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…
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…
Foldable paper constructions known as flexagons have been studied since 1939. In this paper we review the construction of hexagonal flexagons (hexaflexagons) and compute the number of distinct hexaflexagons with n faces.
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
The combinatorics of tilings of a hexagon of integer side-length $n$ by 120 degree - 60 degree diamonds of side-length 1 has a long history, both directly (as a problem of interest in thermodynamic models) and indirectly (through the…
We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible by three. This confirms a conjecture of Bar\'at and Thomassen…
Here we propose a class of frameworks in the plane, braced polygons, that may be globally rigid and are analogous to convex polyopes in 3 space that are rigid by Cauchy's rigidity Theorem in 1813.
Given a tiling $\mathcal{T}$ of the plane by straight edge polygons, which is invariant by two independent translations, we construct a family of embedded triply periodic minimal surfaces which desingularizes $\mathcal{T}\times\mathbb{R}$.…
An N-tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC. We wish to understand…
With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…
There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves…
We show the rigidity of the hexagonal Delaunay triangulated plane under Luo's PL conformality. As a consequence, we obtain a rigidity theorem for a particular type of locally finite convex ideal hyperbolic polyhedra.
We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…
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…
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…
The well-known twenty types of 2-uniform tilings of the plane give rise infinitely many doubly semi-equivelar maps on the torus. In this article, we show that every such doubly semi-equivelar map on the torus contains a Hamiltonian cycle.…
In the prequel of the paper (arXiv:1803.02792), we considered exact enumerations of the cored versions of a doubly-intruded hexagon. The result generalized Ciucu's work about $F$-cored hexagons (Adv. Math. 2017). In this paper, we provide…