The constant-boundary enumeration conjecture for tree sl_n webs
Statement
Let denote the generalized Catalan number associated with parameters . An web is a diagrammatic object for the representation theory of ; a web lacks an internal cycle when its underlying graph has no cycle away from the boundary, and its boundary string records the labels on its boundary edges. Constant-boundary enumeration conjecture. For any , equals the number of connected webs that lack an internal cycle and have a boundary string with total 1's. This conjecture generalizes the preceding enumeration result for (or ) webs to tree webs for . It remains open because the coral-diagram interpretation requires proving the number of valid, non-equivalent choices for the base and each -star, as well as showing that distinct pieces do not interact to produce further relations.
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.