Related papers: Generic extensions are recurrent for aperiodic pro…

$\omega$-periodic graphs are introduced and studied. These are graphs which arise as the limits of periodic extensions of the nearest neighbor graph on the integers. We observe that all bounded degree $\omega$-periodic graphs are ameanable.…

Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…

We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from $\mathbb{Z}^2$ by replacing every edge by a sufficiently large, but fixed number of edges in…

Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…

Many generalizations of continued fractions, where the reciprocal function has been replaced by a more general function, have been studied, and it is often asked whether such generalized expansions can have nice properties. For instance, we…

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

We give sufficient conditions for the uniform hyperbolicity of certain nonuniformly hyperbolic dynamical systems. In particular, we show that local diffeomorphisms that are nonuniformly expanding on sets of total probability are necessarily…

We study random holomorphic endomorphisms of P^k(C). This article is the second part of arXiv:1205.1601

There is only one fully supported ergodic invariant probability measure for the adic transformation on the space of infinite paths in the graph that underlies the Eulerian numbers. This result may partially justify a frequent assumption…

In this paper, we construct explicitely polynomial automorphisms of affine n-space for certain n. More precisely, we construct algebraic subgroups of the general polynomial group GA_n(k) where k is an arbitrary base ring of characteristic…

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

We show that certain groups of piecewise linear homeomorphims of the interval are invariably generated.

The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…

We give strongly aperiodic subshifts of finite type on every hyperbolic surface group; more generally, for each pair of expansive primitive symbolic substitution systems with incommensurate growth rates, we construct strongly aperiodic…

There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…

We prove that the so-called uniadic graph and its adic automorphism are Borel universal, i.e., every aperiodic Borel automorphism is isomorphic to the restriction of this automorphism to a subset invariant under the adic transformation, the…

We introduce a non-autonomous generalization of spatial-temporal differentiations, and prove results about probabilistically and topologically generic behaviors of certain spatial-temporal differentiations generated by endomorphisms of…

Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of a system in which entities can be added and removed. We extend bigraphs to probablistic bigraphs, and then again to action bigraphs, which…

In this paper we give a combinatorial description of the renormlization limits of infinitely renormalizable unimodal maps with {\it essentially bounded} combinatorics admitting quadratic-like complex extensions. As an application we…

We show a general theorem of existence of temporal foliations in a general causal set, under mild constraints. Then we study automorphisms of infinite causal sets (which satisfy further requirements) and show that they fall under one of two…