Abstract:We consider real orthogonal n × n matrices whose diagonal entries are zero and offdiagonal entries nonzero, which we refer to as OMZD(n). We show that there exists an OMZD(n) if and only if n = 1, 3, and that a symmetric OMZD(n) exists if and only if n is even and n = 4. We also give a construction of OMZD(n) obtained from doubly regular tournaments. Finally, we apply our results to determine the minimum number of distinct eigenvalues of matrices associated with some families of graphs, and consider the relate… Show more
“…For a bipartite graph G with bipartition α ∪ β let B(G) be the set of m × n matrices B, with rows and columns indexed by α and β respectively, such that the (i, j) entry of B is nonzero if and only if i and j ′ are adjacent in G. Let G n denote the graph obtained from the complete bipartite graph K n,n by deleting a perfect matching. Using Lemma 5.10 and Theorem 5.13 the authors of [13] show the following.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 97%
“…By Theorem 4.5 we have the following corollary. Recently hollow orthogonal matrices were used in [13] to study the minimum number of distinct eigenvalues of certain families of symmetric matrices. In doing so they used the following construction.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 99%
“…The proof is by induction on n. It is easy to verify that hollow orthogonal matrices of order n = 1, 3 do not exist and that a non-symmetric hollow orthogonal matrix of order n = 2 does not exist. Examples of hollow orthogonal matrices, not equivalent to a symmetric matrix, of order n = 4, 5 are provided in [13]. In particular, for n = 4 we have…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 99%
“…In order to understand the role of hollow orthogonal matrices in [13] we require a few definitions. Let A ∈ Sym n .…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 99%
“…Let G n,k denote the bipartite graph obtained by deleting a matching of size k from K n,n . In order to establish that q(G n,k ) = 2 the authors of [13] constructed many orthogonal matrices. However, this observation is a simple consequence of the SIPP.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
A new condition, the strong inner product property, is introduced and used to construct sign patterns of row orthogonal matrices. Using this property, infinite families of sign patterns allowing row orthogonality are found. These provide insight into the underlying combinatorial structure of row orthogonal matrices. Algorithmic techniques for verifying that a matrix has the strong inner product property are also presented. These techniques lead to a generalization of the strong inner product property and can be easily implemented using various software.
“…For a bipartite graph G with bipartition α ∪ β let B(G) be the set of m × n matrices B, with rows and columns indexed by α and β respectively, such that the (i, j) entry of B is nonzero if and only if i and j ′ are adjacent in G. Let G n denote the graph obtained from the complete bipartite graph K n,n by deleting a perfect matching. Using Lemma 5.10 and Theorem 5.13 the authors of [13] show the following.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 97%
“…By Theorem 4.5 we have the following corollary. Recently hollow orthogonal matrices were used in [13] to study the minimum number of distinct eigenvalues of certain families of symmetric matrices. In doing so they used the following construction.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 99%
“…The proof is by induction on n. It is easy to verify that hollow orthogonal matrices of order n = 1, 3 do not exist and that a non-symmetric hollow orthogonal matrix of order n = 2 does not exist. Examples of hollow orthogonal matrices, not equivalent to a symmetric matrix, of order n = 4, 5 are provided in [13]. In particular, for n = 4 we have…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 99%
“…In order to understand the role of hollow orthogonal matrices in [13] we require a few definitions. Let A ∈ Sym n .…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 99%
“…Let G n,k denote the bipartite graph obtained by deleting a matching of size k from K n,n . In order to establish that q(G n,k ) = 2 the authors of [13] constructed many orthogonal matrices. However, this observation is a simple consequence of the SIPP.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
A new condition, the strong inner product property, is introduced and used to construct sign patterns of row orthogonal matrices. Using this property, infinite families of sign patterns allowing row orthogonality are found. These provide insight into the underlying combinatorial structure of row orthogonal matrices. Algorithmic techniques for verifying that a matrix has the strong inner product property are also presented. These techniques lead to a generalization of the strong inner product property and can be easily implemented using various software.
We study bipartite unitary operators which stay invariant under the local actions of diagonal unitary and orthogonal groups. We investigate structural properties of these operators, arguing that the diagonal symmetry makes them suitable for analytical study. As a first application, we construct large new families of dual unitary gates in arbitrary finite dimensions, which are important toy models for entanglement spreading in quantum circuits. We then analyze the non-local nature of these invariant operators, both in discrete (operator Schmidt rank) and continuous (entangling power) settings. Our scrutiny reveals that these operators can be used to simulate any bipartite unitary gate via stochastic local operations and classical communication. Furthermore, we establish a one-to-one connection between the set of local diagonal unitary invariant dual unitary operators with maximum entangling power and the set of complex Hadamard matrices. Finally, we discuss distinguishability of unitary operators in the setting of the stated diagonal symmetry.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.