Flamingo-web injection conjecture for three-row increasing tableaux

From papers

A normal plabic graph is a plabic graph whose boundary vertices are black of degree 11, whose internal black vertices have degree 33, and in which no two vertices of the same color are joined by an edge. A flamingo web is a normal plabic graph in which every interior face has at least 66 vertices and every white vertex has degree at least 33. Let FW(n,k)\mathrm{FW}(n,k) be the set of flamingo webs with nn boundary vertices for which the number of white vertices minus the number of black interior vertices is kk. Let tripi,3\mathsf{trip}_{i,3} denote the corresponding trip digraphs, let promi\mathsf{prom}_i denote KK-promotion on the associated increasing tableaux, and let τ(W)\tau(W) denote the tableau associated to a web WW. Flamingo-web injection conjecture. Each WFW(q,k)W\in\mathrm{FW}(q,k) has a distinct pair trip1,3,trip2,3\mathsf{trip}_{1,3},\mathsf{trip}_{2,3} of trip digraphs. Moreover, for each WW, there is a unique tableau τ(W)Incq(3×(q2k))\tau(W)\in\operatorname{Inc}^q(3\times(q-2k)) such that

tripi,3(W)=promi(τ(W))for i=1,2.\mathsf{trip}_{i,3}(W)=\mathsf{prom}_i(\tau(W))\qquad\text{for }i=1,2.

This yields an injection τ:FW(q,k)Incq(3×(q2k))\tau:\mathrm{FW}(q,k)\to\operatorname{Inc}^q(3\times(q-2k)) intertwining web rotation with KK-promotion. The conjecture is motivated by a conjectural connection between flamingo webs and Specht modules, while the stated relationship with three-row tableaux and KK-promotion remains open.

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

Rebecca Patrias, Oliver Pechenik and Jessica Striker, “Promotion digraphs”, arXiv:2508.10969 (2026).

Solutions 0

No solutions have been posted yet.