Schinzel's bound on the number of irreducible factors of Kf
Schinzel's bound on the number of irreducible factors of Kf
Let be the polynomial considered in the source, let denote its associated polynomial vocabulary description, let be the number of irreducible factors of over , counted with multiplicities, and let be the norm used in the source. Schinzel's conjecture. There exists a function such that
The conjecture proposes a bound on the number of irreducible factors in terms of the size of ; the supplied context does not establish whether this bound has been proved or disproved.
Sources & referencesView supporting material
Primary source
Jacques Carette and James H. Davenport, “The Power of Vocabulary: The Case of Cyclotomic Polynomials”, arXiv:1002.0012 (2010).
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.