A level N reduction theory of indefinite binary quadratic forms
Number Theory
2007-05-23 v1
Abstract
In this paper we study a geometric coding algorithm for indefinite binary quadratic forms Q for the congruence subgroup \Gamma^0(N), with respect to the usual fundamental domain FN, where N is assumed prime. The cycles Q_1, . . ., Q_n that this algorithm produces are such that the the corresponding paths \gamma_1, . . ., \gamma_n in the Riemann surface X0(N)(C) have a nice behavior around the elliptic points of order 2.
Cite
@article{arxiv.math/0603149,
title = {A level N reduction theory of indefinite binary quadratic forms},
author = {Carlos Castano-Bernard},
journal= {arXiv preprint arXiv:math/0603149},
year = {2007}
}
Comments
25 pages, 7 figures