Type D Chan–Robbins–Yuen volume conjecture

At least 13 years old · documented by

Let KnDK_n^D be the complete signed graph with vertex set [n][n], containing all edges (i,j,±)(i,j,\pm) with 1≤i<j≤n1\leq i<j\leq n, and let

CRYDn=FKnD(2,0,…,0)CRYD_n=\mathcal{F}_{K_n^D}(2,0,\ldots,0)

be its flow polytope. Let Cat(k)=1k+1(2kk)Cat(k)=\frac{1}{k+1}\binom{2k}{k} denote the kkth Catalan number. Type D Chan–Robbins–Yuen volume conjecture. The normalized volume of CRYDnCRYD_n is

vol⁡(CRYDn)=2(n−2)2∏k=0n−2Cat(k).\operatorname{vol}(CRYD_n)=2^{(n-2)^2}\prod_{k=0}^{n-2}Cat(k).

The conjecture is motivated by computed values and a constant-term expression for the volume; the paper gives no proof or resolution of the product formula.

References

Primary source

Karola Meszaros and Alejandro H. Morales, “Flow polytopes of signed graphs and the Kostant partition function”, arXiv:1208.0140 (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.