On the irreducibility of the non-cyclotomic part of most 0,1-polynomials with few terms
Michael Filaseta, Alexandros Kalogirou

TL;DR
This paper demonstrates that for most choices of exponents, the non-cyclotomic part of sparse 0,1-polynomials is irreducible, extending Schinzel's result with an alternative proof approach.
Contribution
It provides an alternative exposition of Schinzel's result showing irreducibility of the non-cyclotomic part of sparse polynomials for almost all exponent choices.
Findings
Most such polynomials are irreducible after removing cyclotomic factors.
The result holds for almost all increasing sequences of positive integers.
The paper offers a new proof approach to Schinzel's theorem.
Abstract
We provide an alternative exposition of a result due to Schinzel. Fix an integer . For almost all choices of positive integers , we show that the polynomial , removed of its cyclotomic factors, is irreducible.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Polynomial and algebraic computation · Advanced Differential Equations and Dynamical Systems
