Parameterizing roots of polynomial congruences
Abstract
We use the arithmetic of ideals in orders to parameterize the roots of the polynomial congruence , monic, irreducible and degree . 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 . We show that only a special class of ideals are needed to parameterize the roots , and that in the cubic setting, , general ideals correspond to pairs of roots , satisfying . At the end we illustrate our parameterization and this correspondence between roots and ideals with a few applications, including finding approximations to , finding an explicit Euler product for the co-type zeta function of , and computing the composition of cubic ideals in terms of the roots and .
Cite
@article{arxiv.2008.00538,
title = {Parameterizing roots of polynomial congruences},
author = {Matthew Welsh},
journal= {arXiv preprint arXiv:2008.00538},
year = {2022}
}
Comments
52 pages, to be published in Algebra and Number Theory