相关论文: On monohedral tilings of a regular polygon

We prove that for every $N\ne 4$ there is only one right triangle that tiles the regular $N$-gon.

Sets of three types of convex pentagons that are aperiodic with no matching conditions on the edges are created from a chiral aperiodic monotile Tile(1, 1). This method divides the interior of Tile(1,1) into five convex polygons with five…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

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$)…

We call "flippable tilings" of a constant curvature surface a tiling by "black" and "white" faces, so that each edge is adjacent to two black and two white faces (one of each on each side), the black face is forward on the right side and…

In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We…

A topological commutative ring is said to be rigid when for every set $X$, the topological dual of the $X$-fold topological product of the ring is isomorphic to the free module over $X$. Examples are fields with a ring topology, discrete…

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…

Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…

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.

This paper proves the following statement: If a convex body can form a three or fourfold translative tiling in the three-dimensional space, it must be a parallelohedron. In other words, it must be a parallelotope, a hexagonal prism, a…

Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…

A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular and its geometric symmetry group has index 2 in its combinatorial automorphism group; thus its automorphism group is…

The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…

Three configurations of two perpendicular disks in R^3 are examined, the first in which the disks share centers and the other two in which the disks touch at precisely one point. Volume, surface area and mean width calculations dominate the…

Let $\textbf{a}_1,\dots, \textbf{a}_r$ be vectors in a half-space of $\mathbb{R}^n$. We call $$C=\textbf{a}_1\mathbb{R}^++\cdots+\textbf{a}_r \mathbb{R}^+$$ a convex polyhedral cone, and call $\{\textbf{a}_1,\dots, \textbf{a}_r\}$ a…

We give a complete solution to the extremal topological combinatorial problem of finding the minimum number of tiles needed to construct a polyomino with $h$ holes. We denote this number by $g(h)$ and say that a polyomino is crystallized if…