A level N reduction theory of indefinite binary quadratic forms
| dc.creator | Castano-Bernard, Carlos | |
| dc.date | 2006-03-06 | |
| dc.date.accessioned | 2026-07-07T07:06:36Z | |
| dc.date.available | 2026-07-07T07:06:36Z | |
| dc.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. | |
| dc.description | 25 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/math/0603149 | |
| dc.identifier | http://arxiv.org/abs/math/0603149 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/110085 | |
| dc.subject | Number Theory | |
| dc.subject | 11E16; 20H05 | |
| dc.title | A level N reduction theory of indefinite binary quadratic forms | |
| dc.type | text |