The lowest-degree polynomials with non-negative coefficients
Tom\'a\v{s} Kepka, Miroslav Korbel\'a\v{r}

TL;DR
This paper investigates the minimal degree of polynomials with non-negative coefficients that are divisible by a given polynomial, extending known results from quadratics to cubics and improving bounds for general polynomials.
Contribution
It determines the lowest degree for cubic polynomials and refines bounds for the minimal degree for arbitrary polynomials with non-negative coefficients.
Findings
Lowest degree for cubic polynomials established
Bounds for general polynomials improved
Characterization of divisibility conditions with non-negative coefficients
Abstract
A polynomial is a divisor of some polynomial with non-negative coefficients if and only if does not have a positive real root. The lowest possible degree of such for a given is known for quadratic polynomials. We provide it for cubic polynomials and improve known bounds of this value for a general polynomial.
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
TopicsAnalytic Number Theory Research · Mathematics and Applications · History and Theory of Mathematics
