ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers n≥m≥2n\geq m\geq2, let G‾m,n\overline{G}_{m,n} be the mm-row, nn-column fishnet graph and let fG‾m,n(z)f_{\overline{G}_{m,n}}(z) denote its graphical function. Define the m×mm\times m Hankel matrix H=(Hi,j)i,j=1,…,mH=(H_{i,j})_{i,j=1,\ldots,m} by

Hi,j(z)=(n−m+i+j−2)!(n−m+i+j−1)!fG‾1,n−m+i+j−1(z).H_{i,j}(z)=(n-m+i+j-2)!(n-m+i+j-1)!f_{\overline{G}_{1,n-m+i+j-1}}(z).

Basso–Dixon fishnet determinant conjecture.

fG‾m,n(z)=det⁡H(z)∏k=n−mn+m−1k!.f_{\overline{G}_{m,n}}(z)=\frac{\det H(z)}{\displaystyle\prod_{k=n-m}^{n+m-1}k!}.

This conjecture gives all rectangular fishnet graphical functions with n≥m≥2n\geq m\geq2 in terms of the one-row ladder functions. The one-row case is known, but the supplied text describes the general fishnets as unsolved and gives no resolution of the determinant formula.

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.