Polynomial-ratio conjecture for repeated-entry generalized monotone triangles
Statement
Let be the generalized monotone-triangle enumeration, let , and let . Polynomial-ratio conjecture. There exist polynomials and satisfying
and
The source gives two lower-index computational examples before formulating this general conjecture; it supplies no proof or resolution.
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.