Backward Rauzy-Veech algorithm and horizontal saddle connections

Przemysław Berk

Home/Archive/arXiv

arXiv · 2109.13691

Backward Rauzy-Veech algorithm and horizontal saddle connections

Przemysław Berk

View original source ↗Read source document ↗Export metadata ↓

Abstract

The goal of this note is to study the action of the backward Rauzy-Veech algorithm on the translation surfaces with horizontal saddle connections. In particular, we prove that the orbit of a translation surface via the aforementioned algorithm is $\infty$-complete if and only if the surface does not posses horizontal saddle connections. Moreover, we show that appearance of all saddle connections as sides of the polygonal representations of the translations surface along the backward Rauzy-Veech induction orbit is equivalent to the minimality of the horizontal translation flow.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Przemysław Berk. 2022-02-23. Backward Rauzy-Veech algorithm and horizontal saddle connections. https://arxiv.org/abs/2109.13691

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗

arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗

arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗