Related papers: Subsystems of transitive subshifts with linear com…
We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…
We define the topological multiplicity of an invertible topological system $(X,T)$ as the minimal number $k$ of real continuous functions $f_1,\cdots, f_k$ such that the functions $f_i\circ T^n$, $n\in\mathbb Z$, $1\leq i\leq k,$ span a…
We extend the classical Pohozaev's identity to semilinear elliptic systems of Hamiltonian type, providing a simpler approach, and a generalization, of the results of E. Mitidieri [6], R.C.A.M. Van der Vorst [14], and Y. Bozhkov and E.…
Linear max-plus systems describe the behavior of a large variety of complex systems. It is known that these systems show a periodic behavior after an initial transient phase. Assessment of the length of this transient phase provides…
We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at which measure-theoretic strong mixing manifests: For every…
Although Sarnak's conjecture holds for compact group rotations (irrational rotations, odometers), it is not even known whether it holds for all Jewett-Krieger models of such rotations. In this paper we show that it does, as long as the…
We define a weak notion of universality in symbolic dynamics and, by generalizing a proof of Mike Hochman, we prove that this yields necessary conditions on the forbidden patterns defining a universal subshift: These forbidden patterns are…
In [Ergodic Theory Dynam. System, 16 (1996) 663--682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is $S$-adic with $\card S \leq 3^{27}$. In this paper, we improve this result by giving an…
We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…
In a wide class of propagators regularized by the $\varepsilon$-metric [1], the $R$-operation is formulated. It is proved that the limit of renormalized Feynman integrals exists and is covariant. Possible applications in gravity are…
A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.
Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
We prove that certain sequences of Laurent polynomials, obtained from a fixed Laurent polynomial P by monomial substitutions, give rise to sequences of Mahler measures which converge to the Mahler measure of P. This generalizes previous…
In this work, we unify several expected generalization error bounds based on random subsets using the framework developed by Hellstr\"om and Durisi [1]. First, we recover the bounds based on the individual sample mutual information from Bu…
We overview our recent work defining and studying normal crossings varieties and subvarieties in symplectic topology. This work answers a question of Gromov on the feasibility of introducing singular (sub)varieties into symplectic topology…
The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $\Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers insight…
We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing…
We respond to the comment by Crutchfield, Feldman and Shalizi and that by Binder and Perry, pointing out that there may be many maximum entropies, and therefore ``disorders'' and ``simple complexities''. Which ones are appropriate depend on…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…