arXiv:1507.04058 [math.NT]AbstractReferencesReviewsResources
Computation of Integral Bases
Published 2015-07-15Version 1
Let $A$ be a Dedekind domain, $K$ the fraction field of $A$, and $f\in A[x]$ a monic irreducible separable polynomial. For a given non-zero prime ideal $\mathfrak{p}$ of $A$ we present in this paper a new method to compute a $\mathfrak{p}$-integral basis of the extension of $K$ determined by $f$. Our method is based on the use of simple multipliers that can be constructed with the data that occurs along the flow of the Montes Algorithm. Our construction of a $\mathfrak{p}$-integral basis is significantly faster than the similar approach from $[7]$ and provides in many cases a priori a triangular basis.
Comments: 22 pages, 4 figures
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:1909.10860 [math.NT] (Published 2019-09-24)
On the computation of overorders
arXiv:2011.14348 [math.NT] (Published 2020-11-29)
Discriminant and Integral basis of sextic fields defined by x^6+ax+b
arXiv:2005.01915 [math.NT] (Published 2020-05-05)
On integral basis of pure number fields