English
Related papers

Related papers: Determining All Universal Tilers

200 papers

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.

Combinatorics · Mathematics 2007-05-23 D. Garijo , A. Marquez , M. P. Revuelta

In this study, the properties of convex pentagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the rotationally symmetric tilings are formed by concave octagons that are generated by two convex pentagons…

Metric Geometry · Mathematics 2022-05-04 Teruhisa Sugimoto

We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.

Combinatorics · Mathematics 2021-01-27 Colin Adams , Cameron Edgar , Peter Hollander , Liza Jacoby

We give a necessary and sufficient condition for the addition of a collection of disjoint bypasses to a convex surface to be universally tight -- namely the nonexistence of a polygonal region which we call a virtual pinwheel.

Geometric Topology · Mathematics 2014-10-01 Ko Honda , William H. Kazez , Gordana Matic

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

Differential Geometry · Mathematics 2010-11-16 François Fillastre

A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuan, Steininger and Yurkevich recently…

Metric Geometry · Mathematics 2026-04-30 Tony Zeng

A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…

Computational Geometry · Computer Science 2025-07-15 Mirela Damian , Henk Meijer

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

Metric Geometry · Mathematics 2011-10-20 Karoly Bezdek , Zsolt Langi , Marton Naszodi , Peter Papez

We show that the spectral-tile implication in the Fuglede conjecture in dimension 1 is equivalent to a Universal Tiling Conjecture and also to similar forms of the same implication for some simpler sets, such as unions of intervals with…

Functional Analysis · Mathematics 2013-01-25 Dorin Ervin Dutkay , Palle E. T. Jorgensen

We give a complete classification of edge-to-edge tilings of the sphere by regular polygons under a unified framework. Without assuming convexity of the tiles or polyhedrality of the underlying graph, our proof is independent of the…

Combinatorics · Mathematics 2025-12-08 Hoi Ping Luk , Roman Nedela , Christopher Purcell

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…

Differential Geometry · Mathematics 2025-12-15 David Brander , Jens Gravesen

It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…

Computational Geometry · Computer Science 2007-07-12 Joseph O'Rourke

We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…

Dynamical Systems · Mathematics 2018-07-10 Charles Radin , Lorenzo Sadun

We say that a triangle $T$ tiles a polygon $A$, if $A$ can be dissected into finitely many nonoverlapping triangles similar to $T$. We show that if $N>42$, then there are at most three nonsimilar triangles $T$ such that the angles of $T$…

Metric Geometry · Mathematics 2020-02-28 M. Laczkovich

Rotationally symmetric tilings by a convex pentagonal tile belonging to both the Type 1 and Type 7 families are introduced. Among them are spiral tilings with two- and four-fold rotational symmetry. Those rotationally symmetric tilings are…

Metric Geometry · Mathematics 2025-01-13 Teruhisa Sugimoto

We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method of determining the graph structure of the polyhedra from a…

Computational Geometry · Computer Science 2020-07-06 Elena Arseneva , Stefan Langerman , Boris Zolotov

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…

Dynamical Systems · Mathematics 2018-07-11 Lorenzo Sadun , R. F. Williams

A set $\Omega \subset \mathbb{R}^d$ is said to be spectral if the space $L^2(\Omega)$ has an orthogonal basis of exponential functions. A conjecture due to Fuglede (1974) stated that $\Omega$ is a spectral set if and only if it can tile the…

Classical Analysis and ODEs · Mathematics 2022-07-05 Nir Lev , Máté Matolcsi

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…

Metric Geometry · Mathematics 2012-10-08 Yohji Akama

We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid--for example, the surface of any polycube. The folding is efficient: for target surfaces…

Computational Geometry · Computer Science 2020-07-20 Nadia M. Benbernou , Erik D. Demaine , Martin L. Demaine , Anna Lubiw