Related papers: $\boldsymbol{S}$-adic sequences. A bridge between …
We study random perturbations of multidimensional piecewise expanding maps. We characterize absolutely continuous stationary measures (acsm) of randomly perturbed dynamical systems in terms of pseudo-orbits linking the ergodic components of…
Sturmian sequences are well-known as the ones having minimal complexity over a 2-letter alphabet. They are also the balanced sequences over a 2-letter alphabet and the sequences describing discrete lines. They are famous and have been…
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence $x$ over a finite alphabet is ultimately periodic if and only if, for some $n$, the number of different factors of length $n$ appearing in $x$ is less than…
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…
"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial answer by defining (non-deterministic) sequential algorithms…
The Stern sequence (s(n)) is defined by s(0) = 0, s(1) = 1, s(2n) = s(n), s(2n+1) = s(n) + s(n+1). Stern showed in 1858 that gcd(s(n),s(n+1)) = 1, and that for every pair of relatively prime positive integers (a,b), there exists a unique n…
The Steinitz lemma, a classic from 1913, states that $a_1,\ldots,a_n$, a sequence of vectors in $\R^d$ with $\sum_1^n a_i=0$, can be rearranged so that every partial sum of the rearranged sequence has norm at most $2d\max \|a_i\|$. In the…
We give a brief review of the AdS/CFT correspondence, which posits the equivalence between a certain gravitational theory and a lower-dimensional non-gravitational one. This remarkable duality, formulated in 1997, has sparked a vigorous…
We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our…
The classical theory of continued fractions has been widely studied for centuries for its important properties of good approximation, and more recently it has been generalized to $p$-adic numbers where it presents many differences with…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and…
We propose novel algorithms for sequence prediction based on ideas from stringology. These algorithms are time and space efficient and satisfy mistake bounds related to particular stringological complexity measures of the sequence. In this…
When quantifying the time spent in the transient of a complex dynamical system, the fundamental problem is that for a large class of systems the actual time for reaching an attractor is infinite. Common methods for dealing with this problem…
A degree sequence is a sequence ${\bf s}=(N_i,i\geq 0)$ of non-negative integers satisfying $1+\sum_i iN_i=\sum_i N_i<\infty$. We are interested in the uniform distribution $\mathbb{P}_{{\bf s}}$ on rooted plane trees whose degree sequence…
Stochastic approximation algorithms are iterative procedures which are used to approximate a target value in an environment where the target is unknown and direct observations are corrupted by noise. These algorithms are useful, for…
Time-continuous dynamical systems defined on graphs are often used to model complex systems with many interacting components in a non-spatial context. In the reverse sense attaching meaningful dynamics to given 'interaction diagrams' is a…
Noise is ubiquitous in various systems. In systems with multiple timescales, noise can induce various coherent behaviors. Self-induced stochastic resonance (SISR) is a typical noise-induced phenomenon identified in such systems, wherein…
The theory of integration over R is rich with techniques as well as necessary and sufficient conditions under which integration can be performed. Of the many different types of integrals that have been developed since the days of Newton and…
We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…