ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n be the symmetric group, let U(n)U(n) be the unitary group, and let Πn\Pi_n be the n!n!-simplex with vertices indexed by SnS_n. For partitions

{1,…,n}=A1∪˙…∪˙Am=B1∪˙…∪˙Bm,\{1,\dots,n\}=A_1\dot\cup\dots\dot\cup A_m=B_1\dot\cup\dots\dot\cup B_m,

with ∣As∣=∣Bs∣|A_s|=|B_s| for 1≤s≤m1\leq s\leq m, define

P(A,B)={α∈Sn:α(As)=Bs, 1≤s≤m}.\mathcal{P}(A,B)=\{\alpha\in S_n:\alpha(A_s)=B_s,\ 1\leq s\leq m\}.

If x=∑α∈P(A,B)xααx=\sum_{\alpha\in\mathcal{P}(A,B)}x_\alpha\alpha, the block decomposition condition requires the non-zero matrix coefficients of uij(x)u_{ij}(x) to be supported on ⋃s=1mBs×As\bigcup_{s=1}^m B_s\times A_s.

Block decomposition conjecture. There should be a continuous function uu from Πn\Pi_n into U(n)U(n) such that each vertex is mapped to the corresponding permutation matrix and the block decomposition condition holds for every such pair of partitions.

The conjecture arises in the analysis of the multivariable classification problem for tensor algebras and reduces the conjectured converse to a topological question about U(n)U(n). The supplied text does not state whether it has been resolved.

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.