Related papers: Decision problems on geometric tilings
In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether…
We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
We say that a tile is $\sigma$-morphic if it tiles the plane in exactly $\aleph_0$ many noncongruent ways (up to an isometry). It is an unsolved problem of whether a $\sigma$-morphic tile exist in the plane. In this note we present a…
We give a general criterion for the Dirichlet problem at infinity (DPI) on a Cartan-Hadamard surface to be solvable, which we primarily use to give the best possible upper radial radial curvature bound for solvability of the DPI, but which…
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…
Sets of $d\times d$ matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existence/non-existence is hard. This problem is known to be…
In this thesis, we consider domino tilings of three-dimensional regions, especially those of the form $\mathcal{D} \times [0,N]$. In particular, we investigate the connected components of the space of tilings of such regions by flips, the…
Given a functional for a one-dimensional physical system, a classical problem is to minimize it by finding stationary solutions and then checking the positive definiteness of the second variation. Establishing the positive definiteness is,…
Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…
The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino…
Capacity control, the bias/variance dilemma, and learning unknown functions from data, are all concerned with identifying effective and consistent fits of unknown geometric loci to random data points. A geometric locus is a curve or surface…
Let $\Gamma$ be a group of type rotating automorphisms of a building $\cB$ of type $\widetilde A_2$, and suppose that $\Gamma$ acts freely and transitively on the vertex set of $\cB$. The apartments of $\cB$ are tiled by triangles, labelled…
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values…
Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in $\mathbb Z^d$. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of…
It is shown that there are primitive substitution tilings with dense tile orientations invariant under n-fold rotation for n=2,3,4,5,6,8. The proof for dense tile orientations uses a general result about irrationality of angles in certain…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
A kind of fixed-point problem in the area of discrete tomography is proposed and investigated. Our chief concern in this paper is the case of square windows in the plane. Dealing with the arrays which are bounded, of polynomial growth, and…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…