On integer partitions and continued fraction type algorithms (Q6122743)

In this interesting paper, the authors put two ideas together, that of integer partitions for positive integers and that of the dynamics behind regular and multidimensional continued fractions. The theory of partitions is one of the richest areas in combinatorics, while continued fractions and their generalizations to the multidimensional cases are important to number theory, to dynamical systems as a rich source of examples and a number of other areas. The authors show that the additive-slow-Farey version of the triangle map (a type of multidimensional continued fraction algorithm) provide a method for producing a map from the set of integer partitions of a positive number \(n\) into itself.