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. For n≥3n \geq 3, let an slnsl_n web have a boundary string consisting of one boundary edge labelled jj followed by boundary edges labelled 11; a web lacks an internal cycle when its underlying graph has no cycle away from the boundary. Non-constant-boundary enumeration conjecture. For any n≥3n \geq 3 and any 1≤j≤n−11 \leq j \leq n-1, (n−2)kRn−1,n−j(k)(n-2)^k R_{n-1,n-j}(k) equals the number of connected slnsl_n webs that lack an internal cycle and have a boundary string consisting of one jj followed by nk+n−jnk + n - j consecutive 1's. This is intended to generalize the preceding proposition for sl3sl_3 webs with a non-constant boundary string. If true, it would give a combinatorial interpretation of Rp,r(k)R_{p,r}(k) for all k≥0k \geq 0 whenever 1≤r≤p−21 \leq r \leq p-2; 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 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.