相关论文: Combinatorial Tilings of the Sphere by Pentagons

Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…

We describe families of plane-filling curves on any edge-to-edge tiling of the plane with regular polygons and finitely many classes of edges. It is shown how to partition the minimal number of edge classes from the group G of symmetries of…

This paper provides a bridge between the classical tiling theory and the complex neighborhood self-assembling situations that exist in practice. The neighborhood of a position in the plane is the set of coordinates which are considered…

We prove that fairly general spaces of tilings of R^d are fiber bundles over the torus T^d, with totally disconnected fiber. This was conjectured (in a weaker form) in [W3], and proved in certain cases. In fact, we show that each such space…

By means of constructing a new edge-bending algorithm, we prove that every locally polyhedral tiling of $\mathbb{R}^3$ can be completely softened. A weaker form of this statement, for polyhedral space tilings, was conjectured by Domokos,…

Starting from the (apparently) elementary problem of deciding how many different topological spaces can be obtained by gluing together in pairs the faces of an octahedron, we will describe the central role played by hyperbolic geometry…

In the article "Construction of the continuous hull for the combinatorics of a regular pentagonal tiling of the plane" we constructed the continuous hull for the combinatorics of "A regular pentagonal tiling of the plane", and in the…

Inspired by the modelization of 2D materials systems, we characterize arrangements of identical nonflat squares in 3D. We prove that the fine geometry of such arrangements is completely characterized in terms of patterns of mutual…

Let $\Delta$ be a $g_2$-minimal normal 3-pseudomanifold. A vertex in $\Delta$ whose link is not a sphere is called a singular vertex. When $\Delta$ contains at most two singular vertices, its combinatorial characterization is known [9]. In…

We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two…

We prove that is a measurable domain tiles R or R^2 by translations, and if it is "close enough" to a line segment or a square respectively, then it admits a lattice tiling. We also prove a similar result for spectral sets in dimension 1,…

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 consider averaged shelling and coordination numbers of aperiodic tilings. Shelling numbers count the vertices on radial shells around a vertex. Coordination numbers, in turn, count the vertices on coordination shells of a vertex, defined…

We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.

It is a classical result that an unrooted tree $T$ having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between each pair of leaves. Moreover, if each non-leaf vertex of $T$…

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…

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 prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…

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…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…