The Qth-power algorithm in characteristic 0

From MaRDI portal
Publication:6239036




Abstract: The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of P:=mathbfF[xn,...,x1], a polyonomial ring over the finite field mathbfF:=mathbfZq of q elements. Here it is shown how to use this for several small primes q to reconstruct similar integral closures over the rationals mathbfQ using the Chinese remainder theorem to piece together presentations in different positive characteristics, and the extended Euclidean algorithm to reconstruct rational fractions to lift these to presentations over mathbfQ.











This page was built for publication: The Qth-power algorithm in characteristic 0

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239036)