|
gap> clan := LinearqClan(3);
<q-clan over GF(3)>
gap> bltset := BLTSetByqClan( clan);
[ <a point in Q(4, 3): -x_1*x_5-x_2*x_4+x_3^2=0>,
<a point in Q(4, 3): -x_1*x_5-x_2*x_4+x_3^2=0>,
<a point in Q(4, 3): -x_1*x_5-x_2*x_4+x_3^2=0>,
<a point in Q(4, 3): -x_1*x_5-x_2*x_4+x_3^2=0> ]
gap> egq := EGQByBLTSet( bltset );
#I Now embedding dual BLT-set into W(5,q)...
#I Computing elation group...
<EGQ of order [ 9, 3 ] and basepoint in W(5, 3 ) >
gap> p := BasePointOfEGQ(egq);
<a point in <EGQ of order [ 9, 3 ] and basepoint in W(5, 3 ) >>
gap> UnderlyingObject(p);
<a point in W(5, 3)>
gap> l := Random(Lines(egq));
<a line in <EGQ of order [ 9, 3 ] and basepoint in W(5, 3 ) >>
gap> UnderlyingObject(l);
<a plane in W(5, 3)>
gap> group := ElationGroup(egq);
<projective collineation group with 5 generators>
gap> Order(group);
243
gap> CollineationGroup(egq);
#I Using elation group to enumerate elements
#I Using elation group to enumerate elements
#I Computing incidence graph of generalised polygon...
#I Using elation of the collineation group...
#I Using elation group to enumerate elements
<permutation group of size 26127360 with 7 generators>
gap> time;
147
gap> egq := EGQByqClan(clan);
#I Computed Kantor family. Now computing EGQ...
<EGQ of order [ 9, 3 ] and basepoint 0>
gap> CollineationGroup(egq);
#I Computing incidence graph of generalised polygon...
#I Using elation of the collineation group...
<permutation group of size 26127360 with 6 generators>
gap> time;
1139
[ Dauer der Verarbeitung: 0.21 Sekunden
(vorverarbeitet)
]
|
