The density of the graph of elliptic Dedekind sums

Abstract

We show that the graph of normalized elliptic Dedekind sums is dense in its image for arbitrary imaginary quadratic fields, generalizing a result of Ito in the Euclidean case. We also derive some basic properties of Martin's continued fraction algorithm for arbitrary imaginary quadratic fields.

Ramanujan Journal

References in corpus (1)

• Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums