Quadrangularity in Tournaments

The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be orthogonal is a property known as combinatorial orthogonality. If...

Full description

Saved in:
Bibliographic Details
Main Authors Lundgren, J. Richard, Severini, Simone, Stewart, Dustin J
Format Journal Article
LanguageEnglish
Published 18.04.2004
Subjects
Mathematics - Combinatorics
Physics - Quantum Physics
Online AccessGet full text

Cover

More Information
Summary:The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be orthogonal is a property known as combinatorial orthogonality. If the adjacency matrix of a directed graph forms a pattern of a combinatorially orthogonal matrix, we say the digraph is quadrangular. We look at the quadrangular property in tournaments and regular tournaments.
DOI:10.48550/arxiv.math/0404320