scientific article; zbMATH DE number 1305288
This paper deals with univariate polynomials over the integers. The \textit{non-reciprocal} part of \(f\) is the quotient of \(f\) by the product of its reciprocal irreducible factors. The paper contains the two following results: Theorem 1: Let \(a<b<c<d<n\) be positive integers. Then the non-reciprocal part of the polynomial \(f=x^n+x^d+x^c+x^b+x^a+1\) is reducible if, and only if, \(f(x)\) is a variation \text{ (in a natural sense)} of \(g(x)=x^{5s+3t}+x^{4s+2t}+x^{2s+2t}+x^t+x^s+1\), which factorizes as \[ g(x)= (x^{3s+2t}-x^{s+t}+x^t+1)(x^{2s+t}+x^s+1), \] where \(s\) and \(t\) denote arbitrary positive integers. Theorem 2: Let \(f(x)\) be an irreducible non-reciprocal polynomial with coefficients \(0\) or \(1\) such that~\(f(0)\not=0\). Then for each positive integer~\(l\), the polynomial \(f(x^l)\) is irreducible. The methods of the proofs are algebraic and related to those used previously by Ljunggren (1960) and by Schinzel (1969). For the entire collection see [Zbl 0911.00025].
- Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts
- On the irreducibility of 0,1-polynomials of the form f(x) xn+ g(x)
- scientific article; zbMATH DE number 1921300
- On an irreducibility theorem of A. Schinzel associated with coverings of the integers
- On an irreducibility theorem of A. Schinzel associated with coverings of the integers
- On a class of lacunary almost Newman polynomials modulo p and density theorems
- On the reducibility and the lenticular sets of zeroes of almost Newman lacunary polynomials
- The non-cyclotomic part of f(x)x^n + g(x) and roots of reciprocal polynomials off the unit circle
- On Newman polynomials which divide no Littlewood polynomial
- Phase retrieval for sparse binary signal: uniqueness and algorithm
- scientific article; zbMATH DE number 1305293 (Why is no real title available?)
- An extension of a theorem by Ljunggren
- scientific article; zbMATH DE number 1054005 (Why is no real title available?)
- scientific article; zbMATH DE number 1921300 (Why is no real title available?)
- Irreducibility criteria for reciprocal polynomials and applications
- Factorization of polynomials with estimates of norms
- Reciprocal monogenic quintinomials of degree \(2^n\)
- Practical aspects of testing the irreducibility of the non-reciprocal part of a 0,1-polynomial
- On the irreducibility of the non-reciprocal part of polynomials of the form \(f(x)x^n+g(x)\)
- Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts
- On the factorization of lacunary polynomials
- On an irreducibility question concerning palindromic non-cyclotomic 0,1-polynomials
- On the irreducibility of the non-cyclotomic part of most 0,1-polynomials with few terms
- On three questions concerning \(0,1\)-polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252157)