Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.03766

A Graph-Based Method for Invariant Densities of Multidimensional Continued Fractions

David Siukaev
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a novel method for computing invariant densities of certain multidimensional continued fraction algorithms. Inspired by Rauzy induction, our approach builds on the formalism of simplicial systems developed by Fougeron. We introduce a win-lose induction on a graph that is conjugate to the original algorithm, and construct its natural extension by introducing the notion of a dual graph. This method explicitly reconstructs the complete dynamics of the algorithm, yielding a partition of the invariant domain of the natural extension into pieces that map to one another. We further study the ergodic properties of the algorithms within this framework; in particular, we prove that the Modified Triangle algorithm in any dimension admits a unique ergodic measure equivalent to the Lebesgue measure.

Explore related subjects

math.DSmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Siukaev. 2026-06-02. A Graph-Based Method for Invariant Densities of Multidimensional Continued Fractions. https://arxiv.org/abs/2606.03766

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↗