Divisiblity of certain standard multinomials by CNS factors of small degree (Q2834176)

A polynomial \(f\in Z[X]\) is called a CNS-polynomial if it is monic, \(f(0)\neq 0\) and for every \(g\in Z[X]\) there exists \(h\in Z[X]\) with coefficients in the interval \([0, | f(0)-1| ]\) with \(g\equiv h\bmod f\) (see \textit{A. Pethő} in [Proceedings of the 2003 Nagoya Conference ``Yokoi-Chowla Conjecture and Related Problems'', 115--125, Saga Univ. (2004)], see Zbl 1083.11003 for the entire collection). These polynomials are useful in the study of canonical number systems.NEWLINENEWLINEThe author considers the set \(P_r\) of polynomials of the form NEWLINE\[NEWLINE\sum_{j=1}^{r-1} X^{n_j}+a\in \mathbb Z[X]NEWLINE\]NEWLINE with \(n_{r-1}>\cdots>n_1>0\), and studies divisibility of CNS-polynomials in \(P_r\) by linear or quadratic \(CNS\)-polynomials. He shows in particular that for \(r\geq3\) every linear \(CNS\)-polynomial divides infinitely many \(CNS\)-polynomials in \(P_r\), and if \(q(X)\) is an irreducible quadratic CNS-polynomial with roots \(\alpha,\beta\) and \(\alpha/\beta\) is not a root of unity, then \(q(X)\) divides infinitely many CNS-polynomials in \(P_3\).