A level N reduction theory of indefinite binary quadratic forms
Carlos Castano-Bernard
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.
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu