The unfair 0-1-polynomial conjecture
Statement
Let be discrete independent random variables with finite support in the natural numbers, and suppose that is uniform on its support. Equivalently, let be a product of monic polynomials with nonnegative real coefficients, where every coefficient of is either or . The unfair 0-1-polynomial conjecture. The random variables and are uniform on their respective supports; equivalently, every coefficient of and belongs to . This is the problem of whether unfairly weighted dice can have a uniformly distributed sum, or equivalently whether a 0-1-polynomial can have a factorization into monic polynomials with nonnegative real coefficients that are not both 0-1-polynomials. The paper studies a first infinite family of cases, but the general problem remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.