Binomial-coefficient random polynomial reducibility conjecture
Statement
Let be a random monic polynomial whose coefficients are independently chosen from according to the distribution. Binomial reducibility conjecture. The probability that is reducible, divided by the probability that its constant coefficient is zero, goes to as goes to infinity. This is proposed as a case of the paper's universality heuristic, in a model where the zero constant coefficient supplies the dominant obvious source of reducibility.
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.