On the irreducibility of 0,1-polynomials of the form f(x) xn+ g(x)
Then non-reciprocal part of a polynomial \(f(x)\in{\mathbb Z}\) is defined as the polynomial \(f(x)\) removed of its reciprocal factors in \({\mathbb Z}[x]\) having a positive leading coefficient. A \(0,1\)-polynomial is a polynomial with each coefficient either \(0\) or \(1\). The main result of the paper says if \(f(x)\) and \(g(x)\) are relatively prime \(0,1\)-polynomials with \(f(0)=g(0)=1\) and \(n>\deg g+2\max\{\deg f,\deg g\}\), then the non-reciprocal of \(f(x)x^n+g(x)\) is irreducible or identically \(1\). (For a related result consult [\textit{M. Filaseta, K. Ford} and \textit{S. Konyagin}, Ill. J. Math. 44, 633--643 (2000; Zbl 0966.11046)].)
- 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)\)
- The non-cyclotomic part of f(x)x^n + g(x) and roots of reciprocal polynomials off the unit circle
- Irreducibility testing of lacunary 0,1-polynomials
- On three questions concerning \(0,1\)-polynomials
- Nonlinear Sierpiński and Riesel numbers
- On a class of lacunary almost Newman polynomials modulo p and density theorems
- Linear relations with conjugates of a Salem number
- The non-cyclotomic part of f(x)x^n + g(x) and roots of reciprocal polynomials off the unit circle
- Reducibility and irreducibility of Stern (0,1)-polynomials
- On Newman polynomials which divide no Littlewood polynomial
- Phase retrieval for sparse binary signal: uniqueness and algorithm
- ON IRREDUCIBLE FACTORS OF THE POLYNOMIAL f(x) - g(y)
- scientific article; zbMATH DE number 1305288 (Why is no real title available?)
- Irreducibility testing of lacunary 0,1-polynomials
- Practical aspects of testing the irreducibility of the non-reciprocal part of a 0,1-polynomial
- On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk
- On the irreducibility of the non-reciprocal part of polynomials of the form \(f(x)x^n+g(x)\)
- Reducibility of polynomials of the form f(x)-g(y)
- A note on the maximal coefficients of squares of Newman polynomials
This page was built for publication: On the irreducibility of 0,1-polynomials of the form f(x) xn+ g(x)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4821090)