Symmetric Conference Matrices of Order pq 2 + 1
Canadian Journal of MathematicsPublished 1 April 1978Open access
Rudolf Mathon
Citations43
SJR quartileQ1
SJR score0.72
SNIP1.06
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
A conference matrix of order n is a square matrix C with zeros on the diagonal and ±1 elsewhere, which satisfies the orthogonality condition CC T = (n — 1)I. If in addition C is symmetric, C = C T , then its order n is congruent to 2 modulo 4 (see [ 5 ]). Symmetric conference matrices ( C ) are related to several important combinatorial configurations such as regular two-graphs, equiangular lines, Hadamard matrices and balanced incomplete block designs [ 1 ; 5 ; and 7, pp. 293-400]. We shall require several definitions.
Keywords
Computer ScienceEngineering
Canadian Journal of MathematicsOrthogonal Matrices with Zero Diagonal
213 Citations1967J.-M. Goethals, J.J. Seidel
