The one-norm characterization of switching equivalence
Statement
Let be a graph on vertices with Seidel adjacency matrix . For , let be the set of diagonal matrices having exactly diagonal entries equal to one and the remaining entries equal to zero, set , and define
where the norm is the operator norm. The one-norm characterization conjecture. For graphs and on vertices, and are switching equivalent if and only if
The paper reports computations supporting this assertion for all switching-equivalent classes on 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.