Related papers: On the complexity function for sequences which are…

The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the…

We prove that every transitive and non minimal semigroup with dense minimal points is sensitive. When the system is almost open, we obtain a generalization of this result.

This paper is concerned with uniform convergence in the multiplicative ergodic theorem on aperiodic subshifts. If such a subshift satisfies a certain condition, originally introduced by Boshernitzan, every locally constant SL(2,R)-valued…

A minimal subshift $(X,T)$ is linearly recurrent if there exists a constant $K$ so that for each clopen set $U$ generated by a finite word $u$ the return time to $U$, with respect to $T$, is bounded by $K|u|$. We prove that given a linearly…

We prove under general assumptions that solutions of the thin obstacle or Signorini problem in any space dimension achieve the optimal regularity $C^{1,1/2}$. This improves the known optimal regularity results by allowing the thin obstacle…

Binary clustering systems are closely related to monotone transit functions. An interesting class are pyramidal transit functions defined by the fact that their transit sets form an interval hypergraph. We investigate here properties of…

We present a streamlined proof of a result essentially present in previous work of the author, namely that for every set $S = \{s_1, s_2, \ldots\} \subset \mathbb{N}$ of zero Banach density and finite set $A$, there exists a minimal…

We study limit cycles in piecewise complex systems with switching manifold $\mathbb{S}^1$. Using M\"obius transformations we establish an equivalence between circular and straight-line discontinuities that preserves periods, stability, and…

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…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

For any subshift, define $F_X(n)$ to be the collection of distinct follower sets of words of length $n$ in $X$. Based on a similar result of the second and third authors, we conjecture that if there exists an $n$ for which $|F_X(n)| \leq…

We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…

In the paper we show that critical sequences associated with the mountain pass level for semilinear elliptic problems on $\R^N$ converge when the non-linearity is subcritical, superlinear and satisfies the penalty condition…

We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary $\epsilon > 0$, with word complexity $p$ satisfying $\limsup \frac{p(q)}{q} < 1.5 + \epsilon$. For arbitrary $f(q) \to \infty$, said subshifts can be made to…

We consider ergodic families of Verblunsky coefficients generated by minimal aperiodic subshifts. Simon conjectured that the associated probability measures on the unit circle have essential support of zero Lebesgue measure. We prove this…

For an aperiodic subshift of finite type $Y$ and for a subshift $X$ with topological entropy less than the topological entropy of $Y$, a theorem is proved in Krieger: On the subsystems of topological Markov chains, Ergodic Theory \&…

We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb N$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type and, in particular, degree-type random elements, which…

We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem…

Let $f$ be an invertible transitive subshift of finite type over a bilateral symbol space $X$, let $\mu$ be a Gibbs measure for $f$ determined by a H\"older continuous potential on $X$, and let $A$ be an invertible continuous linear cocycle…

We suggest necessary conditions of soficness of multidimensional shifts formulated in termsof resource-bounded Kolmogorov complexity. Using this technique we provide examples ofeffective and non-sofic shifts on $\mathbb{Z}^2$ with very low…