Real Schur norms and Hadamard matrices

Abstract

We present a preliminary study of Schur norms \|M\|S=\ \|M C\|: \|C\|=1\, where M is a matrix whose entries are 1, and denotes the entrywise (i.e., Schur or Hadamard) product of the matrices. We show that, if such a matrix M is n-by-n, then its Schur norm is bounded by n, and equality holds if and only if it is a Hadamard matrix. We develop a numerically efficient method of computing Schur norms, and as an application of our results we present several almost Hadamard matrices that are better than were previously known.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…