Related papers: On the complexity function for sequences which are…
Motivated by the search for methods to establish strong minimality of certain low order algebraic differential equations, a measure of how far a finite rank stationary type is from being minimal is introduced and studied: The {\em degree of…
Let $k$ be a field, and let $\mathcal{C}$ be a Cauchy complete $k$-linear braided category with finite dimensional morphism spaces and ${{\rm End}(\bf 1)}=k$. We call an indecomposable object $X$ of $\mathcal C$ non-negligible if there…
This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
Let $j:Y \to X$ be a continuous surjection of compact metric spaces. Whyburn proved that $j$ is irreducible, meaning that $j(F) \subsetneq X$ for any proper closed subset $F \subsetneq Y$, if and only if $j$ is almost one-to-one, in the…
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)…
We show that an Ahlfors $d$-regular set $E$ in $\mathbb{R}^{n}$ is uniformly rectifiable if the set of pairs $(x,r)\in E\times (0,\infty)$ for which there exists $y \in B(x,r)$ and $0<t<r$ satisfying $\mathscr{H}^{d}_{\infty}(E\cap…
We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive…
To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…
Suppose a sequence of random variables {X_n} has negative drift when above a certain threshold and has increments bounded in L^p. When p>2 this implies that EX_n is bounded above by a constant independent of n and the particular sequence…
For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…
Suppose that $\mathcal{X}$ is a sequentially complete Hausdorff locally convex space over a scalar field $\mathbb{K}$, $V$ is a bounded subset of $\mathcal{X}$, $(a_n)_{n\ge 0}$ is a sequence in $\mathbb{K}\setminus\{0\}$ with the property\…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
We prove that a subshift $(X,T)$ is linearly recurrent if and only if it is a primitive and proper $S$-adic subshift. This corrects Proposition 6 in F. Durand ({\it Ergod. Th. & Dynam. Sys. {\bf 20}} (2000), 1061--1078).
Proving complexity lower bounds remains a challenging task: we only know how to prove conditional uniform lower bounds and nonuniform lower bounds in restricted circuit models. Williams (STOC 2010) showed how to derive nonuniform lower…
In this paper, we construct a uniformely recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent…
We prove that any continuous and convex stationary ergodic Hamiltonian admits critical subsolutions, which are strict outside the random Aubry set. They make up, in addition, a dense subset of all critical subsolutions with respect to a…
Given a $C^2$- Anosov diffemorphism $f: M \rightarrow M,$ we prove that the jacobian condition $Jf^n(p) = 1,$ for every point $p$ such that $f^n(p) = p,$ implies transitivity. As application in the celebrated theory of Sinai-Ruelle-Bowen,…
We construct an increasing sequence of natural numbers $(m_n)_{n=1}^{+\infty}$ with the property that $(m_n \th [1])_{n\geq 1}$ is dense in $\T$ for any $\th \in \R\setminus \Q$, and a continuous measure on the circle $\mu$ such that…
We provide a new existence result for weak solutions to the one-dimensional Euler equations with a maximal density constraint, corresponding to a unilateral constraint on the density. Such models arise in the description of congestion…