Essential Discriminant Divisors
Primes that divide the index for every choice of defining polynomial, why they exist, and what they force computationally.
Every page in the KEVOS library tagged Prime Decomposition. 8 pages.
Primes that divide the index for every choice of defining polynomial, why they exist, and what they force computationally.
Using Newton polygons to decompose primes locally, handling the cases where factoring modulo p is insufficient.
How rational primes split, remain inert or ramify in a quadratic field, decided entirely by the Kronecker symbol.
Decomposing a prime that does not divide the index, by factoring the defining polynomial modulo that prime.
How rational primes factor in the maximal order, ramification indices and residue degrees, and the degree relation that constrains them.
Decomposing any prime, including those dividing the index, by splitting the algebra of the order modulo that prime.
The four fundamental computational problems for a number field, their dependencies, and what counts as a complete answer to each.
Ramification indices and residue degrees, the fundamental identity, Dedekind's theorem relating prime decomposition to polynomial factorisation modulo p, and computing valuations.