2013/07/05 by Mark van Hoeij, van Hoeij, Mark
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Cryptography and Residue Arithmetic #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #cs.SC #math.NT
paper · pdf · doi:10.48550/arxiv.1307.1627
4 pages
arxiv created 2013/07/05 · openalex publication_date 2013/07/05 · arxiv updated 2013/07/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The goal in this preprint is to give an efficient algorithm to compute Puiseux expansions at cusps of X0(N). It is based on a relation with a hypergeometric function that holds for any N.