arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1908.09793math.NT
收藏

Monogenic fields arising from trinomials

Ryan Ibarra, Henry Lembeck, Mohammad Ozaslan, Hanson Smith, Katherine E. Stange

英文摘要:

We call a polynomial monogenic if a root $θ$ has the property that $\mathbb{Z}[θ]$ is the full ring of integers in $\mathbb{Q}(θ)$. Consider the two families of trinomials $x^n + ax + b$ and $x^n + cx^{n-1} + d$. For any $n>2$, we show that these families are monogenic infinitely often and give some positive densities in terms of the coefficients. When $n=5$ or 6 and when a certain factor of the discriminant is square-free, we use the Montes algorithm to establish necessary and sufficient conditions for monogeneity, illuminating more general criteria given by Jakhar, Khanduja, and Sangwan using other methods. Along the way we remark on the equivalence of certain aspects of the Montes algorithm and Dedekind's index criterion.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑