Complexity lower bound for typical right triangular billiards

2022/07/02 by Dmitri Scheglov, Scheglov, Dmitri
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Dynamical Systems (math.DS) #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Mathematical Dynamics and Fractals

paper · pdf · doi:10.48550/arxiv.2207.00910

openalex publication_date 2022/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We provide a lower bound on the complexity function of a typical (in the Lebesgue measure sence) right triangular billiard.

Related

• Complexity growth of a typical triangular billiard is weakly exponential
• Lower bounds on directional complexity for irrational triangle billiards
• Complexity and growth for polygonal billiards
• Complexity for billiards in regular N-gons
• On the complexity of polygonal billiards