The Qth-power algorithm in characteristic 0

arXiv1301.6104MaRDI QIDQ6239036FDOQ6239036

Authors: Douglas A. Leonard 

Publication date: 25 January 2013

Abstract: The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=mathbfF[x_n,\mathrm{...},x_1]$, a polyonomial ring over the finite field $mathbfF:=mathbf{Z}_q$ 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$.

Mathematics Subject Classification ID

Integral closure of commutative rings and ideals (13B22)

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)