ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ψ0\psi_0 be the groundstate of the Brauer Hamiltonian, whose entries are weights of chord diagrams. For odd system size L=2n+1L=2n+1, a partial permutation has rank nn; for even size L=2nL=2n, the relevant diagrams correspond to permutations. If πn\pi_n and πm\pi_m are permutations, with one possibly a partial permutation, define their concatenation πn+m\pi_{n+m} by

πn+m(i)=πn(i)(1≤i≤n),πn+m(n+i)=n+πm(i)(1≤i≤m).\pi_{n+m}(i)=\pi_n(i)\quad (1\leq i\leq n),\qquad \pi_{n+m}(n+i)=n+\pi_m(i)\quad (1\leq i\leq m).

Brauer-loop groundstate conjecture. (i) For each system size, the overall normalisation can be chosen so that the smallest element of ψ0\psi_0 is 11 and all other elements are integers. (ii) With this normalisation, the weight of a chord diagram corresponding to the (partial) permutation πn+m\pi_{n+m} equals the product of the weights of the chord diagrams corresponding to πn\pi_n and πm\pi_m. (iii) Among the weights of chord diagrams corresponding to permutations, the weight associated with the long permutation w=(n,n−1,…,2,1)w=(n,n-1,\ldots,2,1) is largest.

These are numerical conjectures about the arithmetic and multiplicative structure of the Brauer-loop groundstate. The source provides numerical evidence but no resolution of these assertions.

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.