A level N reduction theory of indefinite binary quadratic forms

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper we study a geometric coding algorithm for indefinite binary quadratic forms Q for the congruence subgroup Γ^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 γ_1, . . ., γ_n in the Riemann surface X0(N)(C) have a nice behavior around the elliptic points of order 2.
25 pages, 7 figures

Keywords

Number Theory, 11E16; 20H05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/110085

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0603149
 http://arxiv.org/abs/math/0603149

Collections

arXiv