Related papers: Tessellations of surfaces
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
A famous problem in discrete geometry is to find all monohedral plane tilers, which is still open to the best of our knowledge. This paper concerns with one of its variants that to determine all convex polyhedra whose every cross-section…
Identifying parallel sides of a collection of Euclidean polygons yields a flat surface with cone points of angles multiples of 2 pi, naturally a compact Riemann surface but also an algebraic curve, and a hyperbolic surface. In general two…
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 the dynamics of light rays in the trihexagonal tiling where triangles and hexagons are transparent and have equal but opposite indices of refraction. We find that almost every ray of light is dense in a region of a particular…
Every body knows that identical regular triangles or squares can tile the whole plane. Many people know that identical regular hexagons can tile the plane properly as well. In fact, even the bees know and use this fact! Is there any other…
In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a…
We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…
An intriguing correspondence between certain finite planar tessellations and the Descartes circle arrangements is presented. This correspondence may be viewed as a visualization of the spinor structure underlying Descartes circles.
This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…
We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding…
Nested parentheses are forms in an algebra which define orders of evaluations. A class of well-formed sets of associated opening and closing parentheses is well studied in conjunction with Dyck paths and Catalan numbers. Nested parentheses…
This article deals with the construction of surfaces that are suitable for representing pentachords or 5-pitch segments that are in the same $T/I$ class. It is a generalization of the well known \"Ottingen-Riemann torus for triads of…
The study of the structure of translational tilings has captivated mathematicians, scientists, and the general public for centuries and continues to thrive at the crossroads of analysis, combinatorics, dynamics, logic, number theory, and…
We completely classify edge-to-edge tilings of the sphere by congruent quadrilaterals. As part of the classification, we also present a modern version of the classification of edge-to-edge tilings of the sphere by congruent triangles.…
A coloring of a planar semiregular tiling $\mathcal{T}$ is an assignment of a unique color to each tile of $\mathcal{T}$. If $G$ is the symmetry group of $\mathcal{T}$, we say that the coloring is perfect if every element of $G$ induces a…
Crystallographic tilings of the Euclidean space $\mathbb{E}^n$ are defined as simple tilings whose group of isometric automorphisms is crystallographic. To classify crystallographic tilings by their automorphism groups it is necessary to…
We introduce an elementary transformation called flips on tilings by squares and triangles and conjecture that it connects any two tilings of the same region of the Euclidean plane.
In a recent paper, Byun presented nice formulas for the enumeration of lozenge tilings of certain hexagonal regions with intrusions. This paper attempts to generalise some of Byun's investigations.