ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let π∈Sn\pi\in S_n be a permutation, and let E‾π\overline{E}_\pi be the corresponding subset of the upper-upper scheme for pairs of n×nn\times n matrices. For odd size, let π\pi be a partial permutation matrix of rank nn, and let E‾π\overline{E}_\pi be the corresponding subset for an n×(n+1)n\times(n+1) matrix and an (n+1)×n(n+1)\times n matrix.

Brauer-loop degree correspondence conjecture. The groundstate element of the Brauer Hamiltonian for L=2nL=2n corresponding to π∈Sn\pi\in S_n equals the degree of E‾π\overline{E}_\pi. For L=2n+1L=2n+1, the groundstate element corresponding to the rank-nn partial permutation matrix π\pi equals the degree of the corresponding subset E‾π\overline{E}_\pi of the upper-upper scheme.

The conjecture is motivated by explicit agreement for the cases computed in the source, including permutations in S3S_3 and S4S_4, and analogous calculations for odd system sizes. Its general validity remains open in the source.

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.