Related papers: Totally Rank One Interval Exchange Transformations
A hypergraph $(V,E)$ is called an interval hypergraph if there exists a linear order $l$ on $V$ such that every edge $e\in E$ is an interval w.r.t. $l$; we also assume that $\{j\}\in E$ for every $j\in V$. Our main result is a de…
A new recursive function on discrete interval exchange transformation associated to a composition of length $r$, and the permutation $\sigma(i) = r -i +1$ is defined. Acting on composition $c$, this recursive function counts the number of…
This paper reviews some results regarding symbolic dynamics, correspondence between languages of dynamical systems and combinatorics. Sturmian sequences provide a pattern for investigation of one-dimensional systems, in particular interval…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
We prove that return time statistics of a dynamical system do not change if one passes to an induced (i.e. first return) map. We apply this to show exponential return time statistics in i) smooth interval maps with nowhere-dense critical…
We give a survey of the entropy theory of interval maps as it can be analyzed using ergodic theory, especially measures of maximum entropy and periodic points. The main tools are (i) a version of Hofbauer's Markov diagram, (ii) the…
For ergodic measures we consider the return and entry times for a measure preserving transformation and its induced map on a positive measure subset. We then show that the limiting entry and return times distributions are the same for the…
It is shown that, for a C*-algebra of stable rank one (i.e., in which the invertible elements are dense), two well-known isomorphism invariants, the Cuntz semigroup and the Thomsen semigroup, contain the same information. More precisely,…
In this article we prove that given a self-similar interval exchange transformation T, whose associated matrix verifies a quite general algebraic condition, there exists an affine interval exchange transformation with wandering intervals…
We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…
We consider the edge-reinforced random walk with multiple (but finitely many) walkers which influence the edge weights together. The walker which moves at a given time step is chosen uniformly at random, or according to a fixed order.…
For $2\le p<\infty$ we show the lower estimates \[ \|A^{\frac 12}x\|_p \kl c(p)\max\{\pl \|\Gamma(x,x)^{{1/2}}\|_p,\pl \|\Gamma(x^*,x^*)^{{1/2}}\|_p\} \] for the Riesz transform associated to a semigroup $(T_t)$ of completely positive maps…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
For any 1-lipschitz ergodic map $F:\; \mathbb{Z}^{k}_{p} \mapsto \mathbb{Z}^{k}_{p},\;k>1\in\mathbb{N},$ there are 1-lipschitz ergodic map $G:\; \mathbb{Z}_{p} \mapsto \mathbb{Z}_{p}$ and two bijection $H_k$, $T_{k,\;P}$ that $$G = H_{k}…
Let $d >1$. In this paper we show that for an irreducible permutation $\pi$ which is not a rotation, the set of $[\lambda]\in \mathbb{P}_+^{d-1}$ such that the interval exchange transformation $f([\lambda],\pi)$ is not weakly mixing does…
Let $X$ be an infinite linearly ordered set and let $Y$ be a nonempty subset of $X$. We calculate the relative rank of the semigroup $OP(X,Y)$ of all orientation-preserving transformations on $X$ with restricted range $Y$ modulo the…
We provide an explicit S-adic representation of rank one subshifts with bounded spacers and call the subshifts obtained in this way ''Ferenczi subshifts''. We aim to show that this approach is very convenient to study the dynamical behavior…
We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according to a ranking scheme. The link probability of a given vertex is…
Assume that the interval $I=[0,1)$ is partitioned into finitely many intervals $I_1,\dots,I_r$ and consider a map $T\colon I\to I$ so that $T_{\vert I_s}$ is a translation for each $1 \le s \le r$. We do not assume that the images of these…
In a recent paper, Melbourne and Terhesiu [Operator renewal theory and mixing rates for dynamical systems with infinite measure, Invent. Math. 189 (2012), 61-110] obtained results on mixing and mixing rates for a large class of…