1995
DOI: 10.1016/0024-3795(95)00242-j
|View full text |Cite
|
Sign up to set email alerts
|

Two-graphs and skew two-graphs in finite geometries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

1995
1995
2022
2022

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 21 publications
(23 citation statements)
references
References 21 publications
0
23
0
Order By: Relevance
“…The fingerprint is a combinatorial invariant, originally due to Conway that can be computed for any projective plane (see Charnes [5] for a description of this, as Conway has not published). The fingerprint of a general projective plane is rather cumbersome, but for a translation plane a much more compact version can be derived and Moorhouse [18] describes a very simple way of computing the fingerprint. This is based on the representation of a spread of P G (3, 7) as a spread-set.…”
Section: Spread Sets and Fingerprintsmentioning
confidence: 99%
“…The fingerprint is a combinatorial invariant, originally due to Conway that can be computed for any projective plane (see Charnes [5] for a description of this, as Conway has not published). The fingerprint of a general projective plane is rather cumbersome, but for a translation plane a much more compact version can be derived and Moorhouse [18] describes a very simple way of computing the fingerprint. This is based on the representation of a spread of P G (3, 7) as a spread-set.…”
Section: Spread Sets and Fingerprintsmentioning
confidence: 99%
“…As shown in [4] , every 4-subset of ᏻ contains an even number of triples from ⌬ ; thus ⌬ is a two -graph with point set ᏻ . We next show that any 2-subset of ᏻ is contained in exactly 1 -2 ( q n Ϫ 1 ϩ 1)( q Ϫ 1) triples from ⌬ .…”
Section: T He R Esultmentioning
confidence: 99%
“…The O Ϫ 4 ( q ) quadric embeds as an ovoid in O 5 ( q ) and , for q odd , the resulting regular two-graph of degree 1 -2 ( q 2 Ϫ 1) on q 2 ϩ 1 vertices is of Paley type [4] . However , more examples of ovoids in O 5 ( q ) are known [3] .…”
Section: C Oncluding R Emarksmentioning
confidence: 99%
“…In another paper, Charnes and Dempwolff [8] use fingerprints as an aid to classify O + 8 (5) ovoids. Moorhouse in [24] describes a simple way of computing fingerprints which has O(r 3 ) time complexity for an r−cap and shows its connection to two-graphs of ovoids. The ovoids with regular two-graphs have the same fingerprint.…”
Section: A Survey Of Invariantsmentioning
confidence: 99%
“…Note that the isomorphism invariant |P| is sufficient to identify the ovoids in O 5 (q) where q = 9, 25 or 27. (2,27), (3, 60), (7, 3)} {(1, 395), (2,27), (3, 60), (7, 3)} O 13 928 464 464 {(1, 348), (2, 84), (3,12), (4,11), (6, 9)} {(1, 358), (2,66), (3,9), (4,24), (5,6) (2,104), (3,13), (4,8), (5, 1), (6, 2)} {(1, 354), (2,104), (3,13), (4,8), (5, 1), (6, 2)} O 17 796 398 398 {(1, 265), (2,54), (3,48), (4,24), (5,6), (7, 1)} {(1, 265), (2,54), (3,48), (4,24), (5,6), (7, 1)} O 18 688 344 344 {(1, 144), (2,144), (3,…”
mentioning
confidence: 99%