ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Rp,r(k)R_{p,r}(k) denote the generalized Catalan number associated with parameters p,r,kp,r,k. An slnsl_n web is a diagrammatic object for the representation theory of Uq(sln)U_q(sl_n); 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 n≥3n \geq 3, (n−2)kRn+1,n−1(k) (n-2)^k R_{n+1,n-1}(k) equals the number of connected slnsl_n webs that lack an internal cycle and have a boundary string with n(k+1)n(k+1) total 1's. This conjecture generalizes the preceding enumeration result for A2A_2 (or sl3sl_3) webs to tree webs for slnsl_n. It remains open because the coral-diagram interpretation requires proving the number of valid, non-equivalent choices for the base and each (n+1)(n+1)-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.