Related papers: Pattern Complexity of Aperiodic Substitutive Subsh…
We consider a range of simply stated dynamic data structure problems on strings. An update changes one symbol in the input and a query asks us to compute some function of the pattern of length $m$ and a substring of a longer text. We give…
This study introduces a novel approach to composite design by employing aperiodic monotiles, shapes that cover surfaces without translational symmetry. Using a combined computational and experimental approach, we study the fracture behavior…
If $\mathcal{A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal{A}^{\mathbb{N}}$ of sequences with entries in $\mathcal{A}$, along with the left shift operator $S$. Closed $S$-invariant subsets are…
A speedup, like a time change in discrete time dynamics, is a way of moving faster through the orbits of a dynamical system. Linearly recurrence is a stronger form of minimality for subshifts, shared by e.g.\ all primitive substitution…
Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…
For any primitive substitution whose Perron eigenvalue is Pisot unit, we construct a domain exchange measurably conjugated to the subshift. And we give a condition for the subshift to be a finite extension of a torus translation. For the…
We study the periodicity of subshifts of finite type (SFT) on Baumslag-Solitar groups. We show that for residually finite Baumslag-Solitar groups there exist both strongly and weakly-but-not-strongly aperiodic SFTs. In particular, this…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
We address the stability problem for linear switching systems with mode-dependent restrictions on the switching intervals. Their lengths can be bounded as from below (the guaranteed dwell-time) as from above. The upper bounds make this…
Compactifications of heterotic M-theory are shown to provide solutions to the weak- and axion-scale hierarchy problems as a consequence of warped large extra dimensions. They allow a description that is reminiscent of the so-called…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
Synchronisation and pattern formation have been intensely addressed for systems evolving on static networks. Extending the study to include the inherent ability of the network to adjust over time proved cumbersome and led to conclusions…
We investigate different notions of recognizability for a free monoid morphism $\sigma: \mathcal{A}^* \to \mathcal{B}^*$. Full recognizability occurs when each (aperiodic) point in $\mathcal{B}^\mathbb{Z}$ admits at most one tiling with…
Let $\Delta\subsetneq\V$ be a proper subset of the vertices $\V$ of the defining graph of an aperiodic shift of finite type $(\Sigma_{A}^{+},\S)$. Let $\Delta_{n}$ be the union of cylinders in $\Sigma_{A}^{+}$ corresponding to the points…
Let $K$ be an algebraically closed field and let $M_n(K)$ denote the algebra of $n\times n$ matrices over $K$. A classical problem asks for the minimal possible dimension of a maximal commutative subalgebra $A \subseteq M_n(K)$. We…
We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…
We prove that a hyperbolic group admits a strongly aperiodic subshift of finite type if and only if it has at most one end.
Parametricity is a key metatheoretic property of type systems, which implies strong uniformity & modularity properties of the structure of types within systems possessing it. In recent years, various systems of dependent type theory have…
Linear time-periodic (LTP) dynamical systems frequently appear in the modeling of phenomena related to fluid dynamics, electronic circuits, and structural mechanics via linearization centered around known periodic orbits of nonlinear…
The determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold:…