Conference matrices from projective planes of order 9 (Q1060218): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Cor A. J. Hurkens / rank | |||
Property / reviewed by | |||
Property / reviewed by: J. H. van Lint / rank | |||
Property / author | |||
Property / author: Cor A. J. Hurkens / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: J. H. van Lint / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880871 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orthogonal Matrices with Zero Diagonal / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5683869 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4121914 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:09, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conference matrices from projective planes of order 9 |
scientific article |
Statements
Conference matrices from projective planes of order 9 (English)
0 references
1985
0 references
The four known nonisomorphic projective planes of order 9 determine seven nonismorphic affine planes of order 9. From the corresponding transversal designs T(10,9), one finds \(7\times \left( \begin{matrix} 10\\ 5\end{matrix} \right)=1764\) transversal designs T(5,9). Each of these defines a strongly regular graph with parameters (81,40,19,20), i.e. a so-called half-case s.r.g., and a corresponding conference matrix. It is shown that among these there are 175 nonisomorphic strongly regular graphs and 26 nonequivalent conference matrices. These matrices are given in tables. These results depend on a computer search combined with symmetry arguments and the following theorem. Theorem: If K is a graph on four vertices and G is a half-case s.r.g., then G contains as many copies of K as of its complement.
0 references
projective planes of order 9
0 references
transversal designs
0 references
strongly regular graph
0 references
conference matrix
0 references