Complexity growth of a typical triangular billiard is weakly exponential

TL;DR

This paper establishes that the complexity growth rate of a typical triangular billiard system is at most weakly exponential, providing insights into the system's dynamical complexity.

Contribution

It introduces a weakly exponential upper bound on the complexity growth for typical triangular billiards, advancing understanding of their dynamical behavior.

Findings

Complexity growth is at most weakly exponential

Provides a new upper bound for typical triangular billiards

Enhances understanding of billiard dynamical systems

Abstract

We provide a weakly exponential complexity upper bound for typical triangular billiards