On \(\mathbb{Z}\)-dependency of algebraic integers satisfying cubic and quartic polynomials (Q2674409): Difference between revisions

An algebraic integer \(\alpha\) is \(\mathbb{Z}\)-dependent if there exist two distinct sets of rational integers \(x_1,\ldots,x_m\) and \(y_1,\ldots,y_n\) such that \((\alpha+x_1)(\alpha+x_2)\cdots(\alpha +x_m)=(\alpha+y_1)(\alpha+y_2)\cdots(\alpha +y_n)\) for some \(m,n \in \mathbb{N}\). The minimum of \(m+n\) over all admissible \(m,n\) is referred to as the length of \(\alpha\). This paper demonstrates that, for \(m,d \in \mathbb{Z}\) with \(d\neq 0\) and \(|m^2-1|+2|md|>|d^2|+|d|\), the polynomial \(x^3+2mx^2+(m^2-1)x+d\) is irreducible, and its root is \(\mathbb{Z}\)-dependent with the length of at most four (as stated in Theorem 1). Furthermore, Theorem 2 establishes conditions for a quartic polynomial to have root that is \(\mathbb{Z}\)-dependent and of maximum length seven.