The non-constant-boundary enumeration conjecture for tree sl_n webs
Statement
Let denote the generalized Catalan number associated with parameters . For , let an web have a boundary string consisting of one boundary edge labelled followed by boundary edges labelled ; a web lacks an internal cycle when its underlying graph has no cycle away from the boundary. Non-constant-boundary enumeration conjecture. For any and any , equals the number of connected webs that lack an internal cycle and have a boundary string consisting of one followed by consecutive 1's. This is intended to generalize the preceding proposition for webs with a non-constant boundary string. If true, it would give a combinatorial interpretation of for all whenever ; the supplied text indicates that the result remains unproved.
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.