Computational Progress on the Unfair 0-1 Polynomial Conjecture

Abstract: Let $c(x)$ be a monic integer polynomial with coefficients 0 or 1. Write $c(x)=a(x)b(x)$ where $a(x)$ and $b(x)$ are monic polynomials with non-negative real (not necessarily integer) coefficients. The unfair 0-1 polynomial conjecture states that $a(x)$ and $b(x)$ are necessarily integer polynomials with coefficients 0 or 1.

Mathematics

Audience: researchers in the topic

PIMS-CORDS SFU Operations Research Seminar