相关论文: The finite tiling problem is undecidable in the hy…
We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…
One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be…
The hexagon is the least-perimeter tile in the Euclidean plane. On hyperbolic surfaces, the isoperimetric problem differs for every given area. Cox conjectured that a regular $k$-gonal tile with 120-degree angles is isoperimetric for its…
Is there a fixed dimension $n$ such that translational tiling of $\mathbb{Z}^n$ with a monotile is undecidable? Several recent results support a positive answer to this question. Greenfeld and Tao disprove the periodic tiling conjecture by…
R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the…
In this paper, we develop the mathematical tools needed to explore isotopy classes of tilings on hyperbolic surfaces of finite genus, possibly nonorientable, with boundary, and punctured. More specifically, we generalize results on…
The hexagon is the least-perimeter tile in the Euclidean plane for any given area. On hyperbolic surfaces, this "isoperimetric" problem differs for every given area, as solutions do not scale. Cox conjectured that a regular $k$-gonal tile…
We study constrained percolation models on planar lattices including the $[m,4,n,4]$ lattice and the square tilings of the hyperbolic plane, satisfying certain local constraints on faces of degree 4, and investigate the existence of…
A local description of the non-flat infinitesimally bendable Euclidean hypersurfaces was recently given by Dajczer and Vlachos \cite{DaVl}. From their classification, it follows that there is an abundance of infinitesimally bendable…
We study overdetermined problems for fully nonlinear elliptic equations in subdomains $\O$ of the Euclidean sphere $\mathbb{S}^{N}$ and the hyperbolic space $\mathbb{H}^{N}$. We prove, the existence of a classical solution to the underlined…
In this paper, we prove two results. First, there is a family of sequences of embedded quarters of the hyperbolic plane such that any sequence converges to a limit which is an end of the hyperbolic plane. Second, there is no algorithm which…
We exhibit a weakly aperiodic tile set for Baumslag-Solitar groups, and prove that the domino problem is undecidable on these groups. A consequence of our construction is the existence of an arecursive tile set on Baumslag-Solitar groups.
In this paper we present new results regarding the periodicity of outer billiards in the hyperbolic plane around polygonal tables which are tiles in regular two-piece tilings of the hyperbolic plane.
We say that a tiling separates discs of a packing in the Euclidean plane, if each tile contains exactly one member of the packing. It is a known elementary geometric problem to show that for each locally finite packing of circular discs,…
We introduce a new tiling algorithm for hyperbolic 3-manifolds. We use it to compute the maximal cusp area matrix; this completely characterizes the space of all embedded and disjoint cusp neighborhoods. As another application of our work,…
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…
We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.
We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is…
We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.
An irregular vertex in a tiling by polygons is a vertex of one tile and belongs to the interior of an edge of another tile. In this paper we show that for any integer $k\geq 3$, there exists a normal tiling of the Euclidean plane by convex…