Parametrizing roots of polynomial congruences

From MaRDI portal
Publication:2164768



Abstract: We use the arithmetic of ideals in orders to parameterize the roots mupmodm of the polynomial congruence F(mu)equiv0pmodm, F(X)inmathbbZ[X] monic, irreducible and degree d. Our parameterization generalizes Gauss's classic parameterization of the roots of quadratic congruences using binary quadratic forms, which had previously only been extended to the cubic polynomial F(X)=X3−2. We show that only a special class of ideals are needed to parameterize the roots mupmodm, and that in the cubic setting, d=3, general ideals correspond to pairs of roots mu1pmodm1, mu2pmodm2 satisfying gcd(m1,m2,mu1−mu2)=1. At the end we illustrate our parameterization and this correspondence between roots and ideals with a few applications, including finding approximations to fracmuminmathbbR/mathbbZ, finding an explicit Euler product for the co-type zeta function of mathbbZ[2frac13], and computing the composition of cubic ideals in terms of the roots mu1pmodm1 and mu2pmodm2.












This page was built for publication: Parametrizing roots of polynomial congruences

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