Polynomial-ratio conjecture for repeated-entry generalized monotone triangles

Let α\alpha be the generalized monotone-triangle enumeration, let An1:=α(n1;1,2,,n1)A_{n-1}:=\alpha(n-1;1,2,\ldots,n-1), and let nk4n\geq k\geq4. Polynomial-ratio conjecture. There exist polynomials pk(n)p_k(n) and qk(n)q_k(n) satisfying

degpkdegqk=k3\deg p_k-\deg q_k=k-3

and

α(n+1;1,2,,k3,k1,k,k1,k,,n)=pk(n)qk(n)An1.\alpha(n+1;1,2,\ldots,k-3,k-1,k,k-1,k,\ldots,n)=\frac{p_k(n)}{q_k(n)}A_{n-1}.

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

No solutions have been posted yet.