Quadrangularity and Strong Quadrangularity in Tournaments

Simple item page
dc.creatorLundgren, J. Richard
dc.creatorReid, K. B.
dc.creatorSeverini, Simone
dc.creatorStewart, Dustin J.
dc.date2004-09-24
dc.date.accessioned2026-07-07T07:53:38Z
dc.date.available2026-07-07T07:53:38Z
dc.descriptionThe pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. A directed graph is said to support M if its adjacency matrix is the pattern of M. If M is an orthogonal matrix, then a digraph which supports M must satisfy a condition known as quadrangularity. We look at quadrangularity in tournaments and determine for which orders quadrangular tournaments exist. We also look at a more restrictive necessary condition for a digraph to support an orthogonal matrix, and give a construction for tournaments which meet this condition.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/0409474
dc.identifierhttp://arxiv.org/abs/math/0409474
dc.identifierAustralasian Journal of Combinatorics, vol.34, p.247, 2005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126295
dc.subjectCombinatorics
dc.subjectQuantum Physics
dc.subject05C20; 05C50; 05C75
dc.titleQuadrangularity and Strong Quadrangularity in Tournaments
dc.typetext

Files

Collections

arXiv