No CrossRef data available.
Published online by Cambridge University Press: 08 August 2025
Our goal is to show that both the fast and slow versions of the triangle map (a type of multi-dimensional continued fraction algorithm) in dimension n are ergodic, resolving a conjecture of Messaoudi, Noguiera, and Schweiger [Ergodic properties of triangle partitions. Monatsh. Math. 157 (2009), 283–299]. This particular type of higher dimensional multi-dimensional continued fraction algorithm has recently been linked to the study of partition numbers, with the result that the underlying dynamics has combinatorial implications.