Prevalence of matching for families of continued fraction algorithms: old and new results

Carlo Carminati (Università di Pisa)

26-Jan-2021, 13:30-14:30 (3 years ago)

Abstract: We will give an overview of the phenomenon of matching, which was first observed in the family of Nakada's $\alpha$-continued fractions, but is also encountered in other families of continued fraction algorithms.

Our main focus will be the matching property for the family of Ito-Tanaka continued fractions: we will discuss the analogies with Nakada's case (such as prevalence of matching), but also some unexpected features which are peculiar of this case.

The core of the talk is about some recent results obtained in collaboration with Niels Langeveld and Wolfgang Steiner.

dynamical systemsnumber theory

Audience: researchers in the topic

( paper | slides )


One World Numeration seminar

Series comments: Description: Online seminar on numeration systems and related topics

For questions or subscribing to the mailing list, contact the organisers at numeration@irif.fr

Organizers: Shigeki Akiyama, Ayreena Bakhtawar, Karma Dajani, Kevin Hare, Hajime Kaneko, Niels Langeveld, Lingmin Liao, Wolfgang Steiner*
*contact for this listing

Export talk to