A computer-free proof of a theorem of Weiss and Yoshiara (Q1313442)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A computer-free proof of a theorem of Weiss and Yoshiara |
scientific article |
Statements
A computer-free proof of a theorem of Weiss and Yoshiara (English)
0 references
31 January 1994
0 references
The author considers residually connected geometries of type \(c.C_ 2\) admitting a flag transitive automorphism group \(G\). If the \(C_ 2\)- residue is the \(U_ 4(3)\)-quadrangle and \(G\) induces at least \(U_ 4(3)\) on this residue then he proves that the geometry is uniquely determined and \(G\) is Suz or Aut(Suz). A similar result has been obtained by \textit{R. Weiss} and \textit{S. Yoshiara} [J. Algebra 133, No. 1, 182-196 (1990; Zbl 0704.20015)]. But the author claims that in contrast to this proof he does not use the help of a computer. In fact he considers the point incidence graph of the geometry and shows that this graph is the commuting graph for elements of type 3A in Suz. The identification with Suz is by quotation of a result due to \textit{B. Stellmacher} [J. Algebra 30, 320-354 (1974; Zbl 0285.20020)]. Unfortunately the proof of Stellmacher's result involves computer calculations to identify certain groups generated by three of the 3A elements. Hence the paper under review is not really computer free. But as the author knows the exact size of the incidence graph before quoting Stellmacher's result, it should be possible to get the identification avoiding these computer calculations.
0 references
Suzuki-group
0 references
residually connected geometries
0 references
flag transitive automorphism group
0 references
\(C_ 2\)-residue
0 references
\(U_ 4(3)\)-quadrangle
0 references
point incidence graph
0 references
commuting graph
0 references
0 references
0 references