ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Dn\mathcal{D}_n be the set of link patterns of size nn, and let cαπc_{\alpha\pi} be the coefficients introduced in the paper. Write link patterns as binary words, with 1i=(01)i\mathbf{1}_i=(01)^i and 0ℓ+1=0ℓ+11ℓ+1\mathbf{0}_{\ell+1}=0^{\ell+1}1^{\ell+1}. Suppose

π=(01)i0ℓ+11ℓ+1(01)j=1i0ℓ+11j.\pi=(01)^i0^{\ell+1}1^{\ell+1}(01)^j=\mathbf{1}_i\mathbf{0}_{\ell+1}\mathbf{1}_j.

Special-values conjecture. The coefficient is

cαπ={1if α=u0ℓv with ∣u∣=2i+1 and ∣v∣=2j+1,0otherwise.c_{\alpha\pi}=\begin{cases} 1&\text{if $\alpha=u\mathbf{0}_{\ell}v$ with $|u|=2i+1$ and $|v|=2j+1$,}\\ 0&\text{otherwise.} \end{cases}

When ℓ=0\ell=0, this specializes to Thapper's conjecture. The paper states that the conjecture would imply a relation between numbers of fully packed loop configurations on the square grid; its status is not resolved in the supplied text.

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.