ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be a graph on nn vertices with Seidel adjacency matrix SS. For 1≤m≤n1\leq m\leq n, let Dm\mathcal{D}_m be the set of diagonal matrices having exactly mm diagonal entries equal to one and the remaining entries equal to zero, set c=1n−1c=\frac{1}{n-1}, and define

em1(X):=(nm)−1∑D∈Dm∥D(I+cS)D∥,e_m^1(X):={n\choose m}^{-1}\sum_{D\in\mathcal{D}_m}\left\|D(I+cS)D\right\|,

where the norm is the operator norm. The one-norm characterization conjecture. For graphs X1X_1 and X2X_2 on nn vertices, X1X_1 and X2X_2 are switching equivalent if and only if

em1(X1)=em1(X2)for 1≤m≤n.e_m^1(X_1)=e_m^1(X_2)\qquad\text{for }1\leq m\leq n.

The paper reports computations supporting this assertion for all switching-equivalent classes on 4≤n≤104\leq n\leq 10 vertices, while the general claim remains open in the supplied 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.