A finiteness condition for complex continued fraction algorithms

Charlene Kalle, Fanni M. Sélley, Jörg M. Thuswaldner

It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-calle…