Number of orbits of Discrete Interval Exchanges

DOI10.23638/DMTCS-21-3-17MaRDI QIDQ5377235zbMATH OpenFDO

Authors Mélodie Lapointe

Publication date 23 May 2019

Full work available at URL https://arxiv.org/abs/1810.13000, https://dmtcs.episciences.org/5462/pdf

zbMATH Keywords

interval exchangesorbitsRaney treeRauzy induction

Mathematics Subject Classification ID

Trees (05C05)

Abstract: 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 orbits of the discrete interval exchange transformation associated to the composition $c$. Moreover, minimal discrete interval exchanges transformation i.e. the ones having only one orbit, are reduced to the composition which label the root of the Raney tree. Therefore, we describe a generalization of the Raney tree using our recursive function.

Recommendations

• Counting closed orbits in discrete dynamical systems
• The Number of Orbits of Periodic Box-Ball Systems
• Estimates on the number of orbits of the Dyck shift
• The number of periodic orbits of a rational difference equation
• Number of periodic orbits in continuous maps of the interval -- complete solution of the counting problem
• Orbit structure of interval exchange transformations with flip
• Counting closed orbits for the Dyck shift
• scientific article; zbMATH DE number 15140

Cited in

(1)

• Perfectly clustering words are primitive positive elements of the free group

This page was built for publication: Number of orbits of Discrete Interval Exchanges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377235)