A level N reduction theory of indefinite binary quadratic forms
Abstract
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 Q1, . . ., Qn 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.