Related papers: The Doorways Problem and Sturmian Words
Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
For a metrizable space, we consider the space of all metrics generating the same topology of the metrizable space, and this space of metrics is equipped with the supremum metric. In this paper, for every metrizable space, we establish that…
We study the uniform computational content of different versions of the Baire Category Theorem in the Weihrauch lattice. The Baire Category Theorem can be seen as a pigeonhole principle that states that a complete (i.e., "large") metric…
Let $D^+$ be the first octant of the Euclidean space and consider the integral cube grid $G$ in $D^+$. The intersections of each line with $G$ form an infinite sequence of three letters which can be considered as an extension of well-known…
Free boundary problems are those described by PDEs that exhibit a priori unknown (free) interfaces or boundaries. These problems appear in Physics, Probability, Biology, Finance, or Industry, and the study of solutions and free boundaries…
This paper revives a four-decade-old problem concerning regularity theory for (continuous) constraint maps with free boundaries. Dividing the map into two parts, the distance part and the projected image to the constraint, one can prove…
Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each…
Parametrized families of PDEs arise in various contexts such as inverse problems, control and optimization, risk assessment, and uncertainty quantification. In most of these applications, the number of parameters is large or perhaps even…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
Given a measure on the Thurston boundary of Teichmueller space, one can pick a geodesic ray joining some basepoint to a randomly chosen point on the boundary. Different choices of measures may yield typical geodesics with different…
In this article, we present a fresh perspective on language, combining ideas from various sources, but mixed in a new synthesis. As in the minimalist program, the question is whether we can formulate an elegant formalism, a universal…
A pattern $\alpha$ is a string of variables and terminal letters. We say that $\alpha$ matches a word $w$, consisting only of terminal letters, if $w$ can be obtained by replacing the variables of $\alpha$ by terminal words. The matching…
In General Relativity a space-time $M$ is regarded singular if there is an obstacle that prevents an incomplete curve in $M$ to be continued. Usually, such a space-time is completed to form $\bar{M} = M \cup \partial M$ where $\partial M$…
We consider the line planning problem in public transport in the Parametric City, an idealized model that captures typical scenarios by a (small) number of parameters. The Parametric City is rotation symmetric, but optimal line plans are…
We expose a class of discrete metric spaces, for which bounded geometry is equivalent to the property A of G. Yu. This class includes the coarse disjoint union of $(\mathbb Z/2\mathbb Z)^n$, $n\in\mathbb N$, and consists of spaces of simple…
We are concerned with the problem of witnessing the Baire property of the Borel and the projective sets (assuming determinacy) through a sufficiently definable function in the codes. We prove that in the case of projective sets it is…
In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…
Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis, and have been used…
For a class of compactly supported windows we characterize the frame property for a Gabor system $\mts,$ for translation parameters $a$ belonging to a certain range depending on the support size. We show that the obstructions to the frame…