ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let UNNU_N^N be the space of orthogonal matrix models, let KNK_N be the subspace of magic matrices, and let Ψ\Psi be the orthogonalization map. For each fixed integer p≥2p\geq2, define

Fp(x)=1Np∥Tpxξ⊓⊓…⊓∥2.F_p(x)=\frac{1}{N^p}\left\|T_p^x\xi_{\sqcap\hskip-0.5mm\sqcap\ldots\sqcap}\right\|^2.

FpF_p-monotonicity conjecture. For every x∈UNNx\in U_N^N and every p≥2p\geq2,

Fp(x)≥Fp(Ψ2(x)),F_p(x)\geq F_p(\Psi^2(x)),

with equality if and only if x∈KNx\in K_N, in which case Fp(x)=1F_p(x)=1. The source reports computer evidence for this statement and notes that compactness would make it imply convergence of the Sinkhorn-type algorithm.

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.