Local computation of differents and discriminants
Abstract
We obtain several results on the computation of different and discriminant ideals of finite extensions of local fields. As an application, we deduce routines to compute the -adic valuation of the discriminant (f), and the resultant (f,g), for polynomials f(x),g(x)∈ A[x], where A is a Dedekind domain and is a non-zero prime ideal of A with finite residue field. These routines do not require the computation of neither (f) nor (f,g); hence, they are useful in cases where this latter computation is inefficient because the polynomials have a large degree or very large coefficients.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.