Divisibility patterns for terminal segments of Motzkin paths

From papers

Let M=(,e1,,ek)M=(\ldots,e_1,\ldots,e_k) be a Motzkin path of length n+kn+k whose last kk steps are e1,,eke_1,\ldots,e_k.

Terminal-pattern divisibility conjecture. The following implications hold:

M=(,1,0,1,1)(l+2n+5)wl(M),M=(,1,0,0,1,1)(l+2n+7)wl(M),M=(,1,1,1,1,1)(l+2n+2)(l+2n+7)(l+2n+8)wl(M),M=(,1,1,1,0,1,1)(l+2n+2)(l+2n+7)wl(M),M=(,1,1,1,0,0,1,1)(l+2n+2)wl(M),M=(,1,1,1,0,0,0,1,1)(l+2n+2)wl(M),M=(,1,0,1,1,1,1)(l+2n+8)wl(M),M=(,1,1,0,1,1,1)(l+2n+2)(l+2n+8)2wl(M),M=(,1,1,0,1,0,1,1)(l+2n+2)wl(M),M=(,1,1,0,1,0,0,1,1)(l+2n+2)wl(M),M=(,1,1,0,1,0,0,0,1,1)(l+2n+2)wl(M),M=(,1,1,0,0,1,1,1)(l+2n+2)(l+2n+10)wl(M).\begin{gathered} M=(\ldots,1,0,-1,-1)\Rightarrow (l+2n+5)\mid w_l(M),\\ M=(\ldots,1,0,0,-1,-1)\Rightarrow (l+2n+7)\mid w_l(M),\\ M=(\ldots,1,1,-1,-1,-1)\Rightarrow (l+2n+2)(l+2n+7)(l+2n+8)\mid w_l(M),\\ M=(\ldots,1,1,-1,0,-1,-1)\Rightarrow (l+2n+2)(l+2n+7)\mid w_l(M),\\ M=(\ldots,1,1,-1,0,0,-1,-1)\Rightarrow (l+2n+2)\mid w_l(M),\\ M=(\ldots,1,1,-1,0,0,0,-1,-1)\Rightarrow (l+2n+2)\mid w_l(M),\\ M=(\ldots,1,0,1,-1,-1,-1)\Rightarrow (l+2n+8)\mid w_l(M),\\ M=(\ldots,1,1,0,-1,-1,-1)\Rightarrow (l+2n+2)(l+2n+8)^2\mid w_l(M),\\ M=(\ldots,1,1,0,-1,0,-1,-1)\Rightarrow (l+2n+2)\mid w_l(M),\\ M=(\ldots,1,1,0,-1,0,0,-1,-1)\Rightarrow (l+2n+2)\mid w_l(M),\\ M=(\ldots,1,1,0,-1,0,0,0,-1,-1)\Rightarrow (l+2n+2)\mid w_l(M),\\ M=(\ldots,1,1,0,0,-1,-1,-1)\Rightarrow (l+2n+2)(l+2n+10)\mid w_l(M). \end{gathered}

These proposed divisibility relations connect rational roots of wl(M)w_l(M) with the ending of the Motzkin path. The supplied text gives no resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Florian Aigner, “Refined enumerations of alternating sign triangles”, arXiv:1804.10370 (2019).

Solutions 0

No solutions have been posted yet.