A simplified algorithmic realization of Galois actions on special values of modular functions
Abstract
We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon the theory of extended form class groups developed by Jung et al., offering a refinement of earlier methods by Stevenhagen and Cho, respectively.
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.