Triangular systems and a generalization of primitive polynomials (Q480664)

This paper generalizes several well known results about primitive polynomials from integral domains into a general commutative ring setting (with zero-divisors). This generalization is then applied to triangular systems as in [\textit{F. Lemaire} et al., J. Symb. Comput. 46, No. 12, 1291--1305 (2011; Zbl 1234.13028)] and [\textit{Y. Li}, Lect. Notes Comput. Sci. 6167, 89--100 (2010; Zbl 1286.68518)]. A polynomial \(f=a_0 + \ldots + a_nX^n \in R[X]\) with \(a_n \neq 0\) is said to be primitive if \(c(f)\) is not contained in any proper principal ideal of \(R\), where \(c(f)\) is the content of \(f\). Then \(f\) is said to be \textit{s-primitive} if for any \(b\in R\) such that \(ba_i \in a_nR\) for each \(0 \leq i \leq n-1\), \(b \in a_iR\). Lastly, \(f\) is said to be \textit{super-primitive} if \(f\) is s-primitive and \(a_n\) is a regular element of \(R\) (not a zero-divisors). Then super-primitive implies both s-primitive and primitive. Reviewer's remark: A collection of characterizations of s-primitive and super-primitive polynomials are then provided. These results are then applied to ideals in a polynomial ring and then used on triangular systems. It is also interesting that the author provides an example which shows that Theorem 4.4 of [Zbl 1234.13028] and Theorem 2.5 of [Zbl 1286.68518] are incorrect as stated.