ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T(n,k)T(n,k) satisfy the two-dimensional recurrence

T(n,k)T(n−k,k)=T(n−i,k+2)T(n−k+i,k−2)+T(n−j,k+1)+T(n−k+j,k−1),T(n,k)T(n-k,k)=T(n-i,k+2)T(n-k+i,k-2)+T(n-j,k+1)+T(n-k+j,k-1),

with initial terms T(i,j)=xi,jT(i,j)=x_{i,j} for all i<0i<0. Consider the recurrence families conjectured to produce integer sequences in Section 4, excluding the case kk even and j=k2j=\frac{k}{2}. Faithful Laurent polynomial conjecture. For every such remaining family, the recurrence generates faithful Laurent polynomials in the variables xi,jx_{i,j}, meaning Laurent polynomials all of whose coefficients are 11. The conjecture concerns a stronger property than integrality: the terms can then serve as generating functions for combinatorial objects such as perfect matchings. The source gives no evidence of resolution.

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.