Coding of billiards in hyperbolic 3-space

Pradeep Singh

Home/Archive/arXiv

arXiv · 2009.14427

Coding of billiards in hyperbolic 3-space

Pradeep Singh

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we extend the scope of symbolic dynamics to encompass a specific class of ideal polyhedrons in the 3-dimensional hyperbolic space, marking an important step forward in the exploration of dynamical systems in non-Euclidean spaces. Within the context of billiard dynamics, we construct a novel coding system for these ideal polyhedrons, thereby discretizing their state and time space into symbolic representations. This paper distinguishes itself through the establishment of a conjugacy between the space of pointed billiard trajectories and the associated shift space of codes. A crucial finding herein is the observation that the closure of the related shift space emerges as a subshift of finite type (SFT), elucidating the structural aspects and asymptotic behaviour of these systems.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Pradeep Singh. 2023-07-03. Coding of billiards in hyperbolic 3-space. https://arxiv.org/abs/2009.14427

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↗