Related papers: The Doorways Problem and Sturmian Words
A closed piecewise linear curve is called integral if it is comprised of unit intervals. Kenyon's problem asks whether for every integral curve $\gamma$ in $\mathbb{R}^3$, there is a dome over $\gamma$, i.e. whether $\gamma$ is a boundary…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
$\textit{Partial words}$ are words that contain, in addition to letters, special symbols $\diamondsuit$ called $\textit{holes}$. Two partial words of $a=a_0 \dots a_n$ and $b=b_0 \dots b_n$ are $\textit{compatible}$ if for all $i$, $a_i =…
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry…
We consider how the problem of determining normal forms for a specific class of nonholonomic systems leads to various interesting and concrete bridges between two apparently unrelated themes. Various ideas that traditionally pertain to the…
We give an explicit algorithm to construct aperiodic tile sets based on Sturmian words of quadratic slopes. The method works for any quadratic irrational slope, and we can produce infinitely many aperiodic tile sets whose underlying scaling…
In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs. We prove that, in the context of Constraint Satisfaction Problems,…
The paper has a form of a survey and consists of three parts. It is focused on the relationship between the many-sorted theory, which leads to logical geometry and one-sorted theory, which is based on the important model-theoretic concepts.…
Two Delone sets are called homometric when they share the same autocorrelation or Patterson measure. A model set LAMBDA within a given cut and project scheme is a Delone set that is defined through a window W in internal space. The…
A subshift of finite type over finitely many symbols can be described as a collection of all infinite walks on a digraph with at most a single edge from a vertex to another. The associated finite set $\F$ of forbidden words is a constraint…
In this paper, we analyze the periodic factors of Sturmian words for the findings to lead to a linear-time algorithm for the computation of runs in this class of words which, to our best knowledge, is an open problem in literature.
The ancient unsolved problem of congruent numbers has been reduced to one of the major questions of contemporary arithmetic: the finiteness of the number of curves over $\bf Q$ which become isomorphic at every place to a given curve. We…
An important problem in geometric reasoning is to find the configuration of a collection of geometric bodies so as to satisfy a set of given constraints. Recently, it has been suggested that this problem can be solved efficiently by…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
The completeness properties of spaces of immersed curves equipped with reparametrization-invariant Riemannian metrics have recently been the subject of active research. This thesis studies the metric completion of spaces of immersed open…
A criterion for the existence of a plane model of an algebraic curve such that the Galois closures of projections from two points are the same is presented. As an application, it is proved that the Hermitian curve in positive characteristic…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
Given two general rational curves of the same degree in two projective spaces, one can ask whether there exists a third rational curve of the same degree that projects to both of them. We show that, under suitable assumptions on the degree…
The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of $\mathbb{Z}^2$-subshifts of finite type are standard problems of symbolic dynamics. In this article we study these questions with horizontal…
Klavik et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition…