当前位置: X-MOL 学术Algebra Number Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Parametrizing roots of polynomial congruences
Algebra & Number Theory ( IF 0.9 ) Pub Date : 2022-08-05 , DOI: 10.2140/ant.2022.16.881
Matthew Welsh

We use the arithmetic of ideals in orders to parametrize the roots μ(modm) of the polynomial congruence F(μ) 0(modm), F(X) [X] monic, irreducible and degree d. Our parametrization generalizes Gauss’s classic parametrization 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 parametrize the roots μ(modm), and that in the cubic setting, d = 3, general ideals correspond to pairs of roots μ1(modm1), μ2(modm2) satisfying gcd (m1,m2,μ1 μ2) = 1. At the end we illustrate our parametrization and this correspondence between roots and ideals with a few applications, including finding approximations to μ m , finding an explicit Euler product for the cotype zeta function of [213], and computing the composition of cubic ideals in terms of the roots μ1(modm1) and μ2(modm2).



中文翻译:

多项式同余的参数化根

我们使用理想的算术来参数化根μ(模组)多项式同余的F(μ) 0(模组),F(X) [X]monic、不可约和度数d. 我们的参数化使用二元二次形式推广了 Gauss 对二次同余根的经典参数化,以前只扩展到三次多项式F(X) = X3 - 2. 我们证明了只需要一类特殊的理想来参数化根μ(模组),并且在立方设置中,d = 3, 一般理想对应于成对的根μ1(模组1),μ2(模组2)令人满意的gcd (1,2,μ1 - μ2) = 1. 最后,我们通过一些应用来说明我们的参数化以及根和理想之间的这种对应关系,包括找到 μ , 为 cotype zeta 函数找到一个显式的欧拉积[213],并根据根计算三次理想的组成μ1(模组1)μ2(模组2).

更新日期:2022-08-05
down
wechat
bug