Polynomial-ratio conjecture for repeated-entry generalized monotone triangles
Polynomial-ratio conjecture for repeated-entry generalized monotone triangles
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.
Sources & referencesView supporting material
Primary source
Lukas Riegler, “Generalized Monotone Triangles: an extended Combinatorial Reciprocity Theorem”, arXiv:1207.4437 (2012).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.