Polyhedrality conjecture for graph functionals of compact Lie groups
Statement
Let be a sscc Lie group and let be a connected graph with vertices and edges. Write and , and let be the weight lattice of . For each edge , let be a dominant weight, and let denote the associated graph functional. Graph-functional polyhedrality conjecture. There exists a sublattice of maximal rank such that, if , then
If , then equals the number of integer points in a polytope whose generic dimension is
The dimension has this value whenever all the dominant weights lie in the interior of the Weyl chamber; the defining equations of the polytope are affine in the weights, and the polytope is contained in the string cone . This conjecture proposes a uniform polyhedral description of graph functionals, generalising the corresponding descriptions of dimensions and Littlewood--Richardson coefficients. The source presents it as a conjectural extension motivated by the circuit expansion for random geometric graphs; no resolution is supplied.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.