相关论文: Rotated Odometers and Actions on Rooted Trees
We describe the infinite interval exchange transformations, called the rotated odometers, that are obtained as compositions of finite interval exchange transformations and the von Neumann-Kakutani map. We show that with respect to Lebesgue…
We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…
We study an interval exchange transformation of [0,1] formed by cutting the interval at the points 1/n and reversing the order of the intervals. We find that the transformation is periodic away from a Cantor set of Hausdorff dimension zero.…
A disjoint rotation map is an interval exchange transformation (IET) on the unit interval that acts by rotation on a finite number of invariant subintervals. It is currently unknown whether the group E of all IETs possesses any non-abelian…
Rotation distance between rooted binary trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. We give an efficient,…
Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we…
We prove a general result about the decomposition on ergodic components of group actions on boundaries of spherically homogeneous rooted trees. Namely, we identify the space of ergodic components with the boundary of the orbit tree…
A rooted tree T is a poset whose Hasse diagram is a graph-theoretic tree having a unique minimal element. We study rowmotion on antichains and lower order ideals of T. Recently Elizalde, Roby, Plante and Sagan considered rowmotion on fences…
Interval translation maps (ITMs) are a non-invertible generalization of interval exchange transformations (IETs). The dynamics of finite type ITMs is similar to IETs, while infinite type ITMs are known to exhibit new interesting effects. In…
Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a…
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…
Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…
Behavior Trees constitute a widespread AI tool which has been successfully spun out in robotics. Their advantages include simplicity, modularity, and reusability of code. However, Behavior Trees remain a high-level decision making engine;…
We establish a dichotomy for the rate of the decay of the Ces\`aro averages of correlations of sufficiently regular functions for typical interval exchange transformations (IET) which are not rigid rotations (for which weak mixing had been…
We consider the activated random walk particle system, a model of self-organized criticality, on $\mathbb{Z}$ with i.i.d.-Bernoulli initial configuration. We show that at subcritical density, the system's odometer function, which counts the…
We study the ergodic properties (recurrence, discrepancy, diffusion coefficients and ergodicity itself) of a class of $\mathbb Z$-extensions over infinite interval exchange transformations called rotated odometers. The choice of a…
Extensive amenability is a property of group actions which has recently been used as a tool to prove amenability of groups. We study this property and prove that it is preserved under a very general construction of semidirect products. As…
We study isometric actions of finitely presented groups on $\mathbb{R}$-trees. In this paper, we develop a relative version of the Rips machine to study $\textit{pairs}$ of such actions. An important example of a $\textit{pair}$ is a group…
A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…
The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable…