Supersingular j-invariants and the Class Number of Q(-p)

Abstract

For a prime p>3, let D be the discriminant of an imaginary quadratic order with |D|< 43p. We research the solutions of the class polynomial HD(X) mod p in Fp if D is not a quadratic residue in Fp. We also discuss the common roots of different class polynomials in Fp. As a result, we get a deterministic algorithm (Algorithm 3) for computing the class number of Q(-p). The time complexity of Algorithm 3 is O(p3/4+ε).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…