Related papers: Limited scope adic transformations
We introduce an adic (Bratteli-Vershik) dynamical system based on a diagram whose path counts from the root are the Delannoy numbers. We identify the ergodic invariant measures, prove total ergodicity for each of them, and initiate the…
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…
We present a novel way of realizing the Bernoulli shift on $p$ symbols on the $p$-adic integers, where $p$ is a prime. By showing that suitably small perturbations of the shift are still Bernoulli we find many "nice" maps, such as…
The famous Bernoulli shift (or dyadic transformation) is perhaps the simplest deterministic dynamical system exhibiting chaotic dynamics. It is a piecewise linear time-discrete map on the unit interval with a uniform slope larger than one,…
The Euler graph has vertices labelled (n,k) for n=0,1,2,... and k=0,1,...,n, with k+1 edges from (n,k) to (n+1,k) and n-k+1 edges from (n,k) to (n+1,k+1). The number of paths from (0,0) to (n,k) is the Eulerian number A(n,k), the number of…
We study the dynamics of a transformation that acts on infinite paths in the graph associated with Pascal's triangle. For each ergodic invariant measure the asymptotic law of the return time to cylinders is given by a step function. We…
We prove that certain Gibbs measures on subshifts of finite type are nonsingular and ergodic for certain countable equivalence relations, including the orbit relation of the adic transformation (the same as equality after a permutation of…
We classify the ergodic invariant random subgroups of block-diagonal limits of symmetric groups in the cases when the groups are simple and the associated dimension groups have finite dimensional state spaces. These block-diagonal limits…
It is well-known that the Lebesgue measure is the unique absolutely continuous invariant probability measure under the $p$-adic transformation. The purpose of this paper is to characterize the family of all invariant probability measures…
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…
For any adic transformation $T$ defined on the path space $X$ of an ordered Bratteli diagram, endowed with a Markov measure $\mu$, we construct an explicit dimension space (which corresponds to a matrix values random walk on $\mathbb{Z}$)…
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…
This paper develops the theory of Dirac reduction by symmetry for nonholonomic systems on Lie groups with broken symmetry. The reduction is carried out for the Dirac structures, as well as for the associated Lagrange-Dirac and…
We describe a family $\phi_{\lambda}$ of dynamical systems on the unit interval which preserve Bernoulli convolutions. We show that if there are parameter ranges for which these systems are piecewise convex, then the corresponding Bernoulli…
We formulate and prove a Jakobson-Benedicks-Carleson type theorem on the occurence of nonuniform hyperbolicity (stochastic dynamics) in families of one-dimensional maps, based on "computable starting conditions" and providing "explicit,…
For an open and dense subset of elliptic ${\rm SL}(2,\mathbb R)$ matrix cocycles, we construct a family of loosely Bernoulli ergodic measures with zero top Lyapunov exponent. This provides a counterpart to a classical result by Furstenberg.…
We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic…
Following Schweiger's generalization of multidimensional continued fraction algorithms, we consider a very large family of $p$-adic multidimensional continued fraction algorithms, which include Schneider's algorithm, Ruban's algorithms, and…
We consider arbitrary orderings of the edges entering each vertex of the (downward directed) Pascal graph. Each ordering determines an adic (Bratteli-Vershik) system, with a transformation that is defined on most of the space of infinite…
We consider families of transformations in multidimensional Riemannian manifolds with non-uniformly expanding behavior. We give sufficient conditions for the continuous variation (in the $L^1$-norm) of the densities of absolutely continuous…