Monogenic binomial compositions (Q2663358): Difference between revisions

Let \(P\) be a monic polynomial, with rational integer coefficients and degree \(\deg (P)\geq 2\), and let \(\theta \) be a zero of \(P\). Then, \(P\) is said to be monogenic if \(P\) is irreducible and the set \(\{1,\theta,\dots,\theta ^{\deg (P)-1}\}\) is a basis of the ring \(\mathbb{Z}_{\mathbb{Q} (\theta)}\) of the integers of \(\mathbb{Q}(\theta)\). In other words, \(P\) is monogenic if and only if \(P\) is irreducible and \(\mathbb{Z}_{\mathbb{Q} (\theta)}=\mathbb{Z}[\theta]\), or equivalently, \(P\) is irreducible and the discriminant of the field \(\mathbb{Q}(\theta)\) is equal to the discriminant of the polynomial \(P\). In the paper under review, the authors give sets of conditions, mainly presented in three theorems, that make the polynomials \(P_{(m,k)}(x):=x^{m}-k \) and \(P_{(m,k)}(P_{(n,l)}(x))=(x^{n}-l)^{m}-k\), where \(m\geq 2\), \(n\geq 2\) and \((l,k)\in \mathbb{Z}^{2}\), both monogenic. The proofs of these results use Dedekind's criterion and a theorem of \textit{T. A. Gassert} [Albanian J. Math. 11, 3--12 (2017; Zbl 1392.11082)], which says that the polynomial \(P_{(m,k)} \) is monogenic if and only if \(k\) is squarefree and \(k^{p}\neq k\pmod{p^{2}}\) for all primes \(p\) dividing \(m\).