Flamingo-web injection conjecture for three-row increasing tableaux
Flamingo-web injection conjecture for three-row increasing tableaux
A normal plabic graph is a plabic graph whose boundary vertices are black of degree , whose internal black vertices have degree , 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 vertices and every white vertex has degree at least . Let be the set of flamingo webs with boundary vertices for which the number of white vertices minus the number of black interior vertices is . Let denote the corresponding trip digraphs, let denote -promotion on the associated increasing tableaux, and let denote the tableau associated to a web . Flamingo-web injection conjecture. Each has a distinct pair of trip digraphs. Moreover, for each , there is a unique tableau such that
This yields an injection intertwining web rotation with -promotion. The conjecture is motivated by a conjectural connection between flamingo webs and Specht modules, while the stated relationship with three-row tableaux and -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
Sign in to submit a solution.
No solutions have been posted yet.