Schinzel's factorization conjecture for sparse Laurent polynomials
Schinzel's factorization conjecture for sparse Laurent polynomials
Let . A Laurent polynomial is cyclotomic if it is a unit times the composition of a univariate cyclotomic polynomial with a monomial. For each , write for the resulting Laurent polynomial in .
Schinzel's factorization conjecture. There is a finite set of matrices such that, for each , there are and with such that if is an irreducible factor of , then is either a product of cyclotomic Laurent polynomials or an irreducible factor of .
The conjecture seeks a uniform finite description of the non-cyclotomic factors arising under monomial specialization, while allowing cyclotomic factors as exceptional components. Its status is not resolved in the supplied text.
Sources & referencesView supporting material
Primary source
Francesco Amoroso and Martín Sombra, “Factorization of bivariate sparse polynomials”, arXiv:1710.11479 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.