Computing with elation groups


Autoria(s): Havas, George; Leedham-Green, C. R.; O'Brien, E. A.; Slattery, Michael C.
Contribuinte(s)

A. Hulpke

R. Liebler

T. Penttila

A. Seress

Data(s)

01/01/2006

Resumo

We have proved that elation groups of a certain infinite family of Roman generalized quadrangles are not isomorphic to those of associated flock generalized quadrangles. The proof is theoretical, but is based upon detailed computations. Here we elaborate on the explicit computer calculations which inspired the proof.

Identificador

http://espace.library.uq.edu.au/view/UQ:104380

Publicador

Walter de Gruyter

Palavras-Chave #E1 #280405 Discrete Mathematics #780101 Mathematical sciences
Tipo

Conference Paper