A nearfield is a nearring with 1 where each nonzero element has a multiplicative inverse. The (additive) group reduct of a finite nearfield is necessarily elementary abelian. For an exposition of nearfields we refer to <[>Waehling:Fastkoerper].
Let (N,+,·) be a left nearring. For a,b Î N we define a º b iff a·n = b·n for all n Î N. If a º b, then a and b are called equivalent multipliers. A nearring N is called planar if  N/_{ º }  ³ 3 and if for any two nonequivalent multipliers a and b in N, for any c Î N, the equation a·x = b·x + c has a unique solution. See <[>Clay:Nearrings] for basic results on planar nearrings.
All finite nearfields are planar nearrings.
A left nearring (N,+,·) is called weakly divisible if "a,b Î N $x Î N : a·x = b or b·x = a.
All finite integral planar nearrings are weakly divisible.
IsPairOfDicksonNumbers(
q,
n )
A pair of Dickson numbers (q,n) consists of a prime power integer q and a natural number n such that for p = 4 or p prime, pn implies pq1.
gap> IsPairOfDicksonNumbers( 5, 4 ); true
DicksonNearFields(
q,
n )
All finite nearfields with 7 exceptions can be obtained via socalled coupling maps from finite fields. These nearfields are called Dickson nearfields.
The multiplication map of such a Dickson nearfield is given by a pair of Dickson numbers (q,n) in the following way:
Let F = GF(q^{n}) and w be a primitive element of F. Let H be the subgroup of (F\{0},·) generated by w^{n}. Then {w^{(qi1)/(q1)}  0 £ i £ n1 } is a set of coset representatives of H in F\{0}. For f Î Hw^{(qi1)/(q1)} and x Î F define f*x = f·x^{qi} and 0*x = 0. Then * is a nearfield multiplication on the additive group (F,+).
Note that a Dickson nearfield is not uniquely determined by (q,n), since w can be chosen arbitrarily. Different choices of w may yield isomorphic nearfields.
DicksonNearFields
returns a list of the nonisomorphic Dickson nearfields
determined by the pair of Dickson numbers (q,n)
gap> DicksonNearFields( 5, 4 ); [ ExplicitMultiplicationNearRing ( <pc group of size 625 with 4 generators> , multiplication ), ExplicitMultiplicationNearRing ( <pc group of size 625 with 4 generators> , multiplication ) ]
NumberOfDicksonNearFields(
q,
n )
NumberOfDicksonNearFields
returns the number of nonisomorphic Dickson
nearfields which can be obtained from a pair of Dickson numbers (q,n).
This number is given by F(n)/k. Here F(n) denotes the number
of relatively prime residues modulo n and k is the multiplicative order
of p modulo n where p is the prime divisor of q.
gap> NumberOfDicksonNearFields( 5, 4 ); 2
ExceptionalNearFields(
q )
There are 7 finite nearfields which cannot be obtained from finite fields via a Dickson process. They are of size p^{2} for p = 5, 7, 11, 11, 23, 29, 59. (There exist 2 exceptional nearfields of size 121.)
ExceptionalNearFields
returns the list of exceptional nearfields for a given
size q.
gap> ExceptionalNearFields( 25 ); [ ExplicitMultiplicationNearRing ( <pc group of size 25 with 2 generators> , multiplication ) ]
AllExceptionalNearFields()
There are 7 finite nearfields which cannot be obtained from finite fields via a Dickson process. They are of size p^{2} for p = 5, 7, 11, 11, 23, 29, 59. (There exist 2 exceptional nearfields of size 121.)
AllExceptionalNearFields
without argument returns the list of exceptional
nearfields.
gap> AllExceptionalNearFields(); [ ExplicitMultiplicationNearRing ( <pc group of size 25 with 2 generators> , multiplication ), ExplicitMultiplicationNearRing ( <pc group of size 49 with 2 generators> , multiplication ), ExplicitMultiplicationNearRing ( <pc group of size 121 with 2 generators> , multiplication ), ExplicitMultiplicationNearRing ( <pc group of size 121 with 2 generators> , multiplication ), ExplicitMultiplicationNearRing ( <pc group of size 529 with 2 generators> , multiplication ), ExplicitMultiplicationNearRing ( <pc group of size 841 with 2 generators> , multiplication ), ExplicitMultiplicationNearRing ( <pc group of size 3481 with 2 generators> , multiplication ) ]
PlanarNearRing(
G,
phi,
reps )
A finite Ferrero pair is a pair of groups (N,F) where F is a fixedpointfree automorphism group of (N,+).
Starting with a Ferrero pair (N,F) we can construct a planar nearring in the following way, <[>Clay:Nearrings:] Select representatives, say e_{1},¼,e_{t}, for some or all of the nontrivial orbits of N under F. Let C = F(e_{1})È¼ÈF(e_{t}). For each x Î N we define a * x = 0 for a Î N\C, and a * x=f_{a}(x) for a Î F(e_{i}) Ì C and f_{a}(e_{i})=a. Then (N,+,*) is a (left) planar nearring.
Every finite planar nearring can be constructed from some Ferrero pair together with a set of orbit representatives in this way.
PlanarNearRing
returns the planar nearring on the group G determined by
the fixedpointfree automorphism group phi and the list of chosen orbit
representatives reps.
gap> C7 := CyclicGroup( 7 );; gap> i := GroupHomomorphismByFunction( C7, C7, x > x^1 );; gap> phi := Group( i );; gap> orbs := Orbits( phi, C7 ); [ [ <identity> of ... ], [ f1, f1^6 ], [ f1^2, f1^5 ], [ f1^3, f1^4 ] ] gap> # choose reps from the orbits gap> reps := [orbs[2][1], orbs[3][2]]; [ f1, f1^5 ] gap> n := PlanarNearRing( C7, phi, reps ); ExplicitMultiplicationNearRing ( <pc group of size 7 with 1 generators> , multiplication )
OrbitRepresentativesForPlanarNearRing(
G,
phi,
i )
Let (N,F) be a Ferrero pair, and let E = { e_{1},¼,e_{s} } and
F = { f_{1},¼,f_{t} } be two sets of nonzero orbit representatives.
The nearring obtained from N,F, E by the Ferrero construction
(see PlanarNearRing
) is isomorphic to the nearring obtained from N,F, F
iff there exists an automorphism a of (N,+) that normalizes F
such that
{ a(e_{1}),¼,a(e_{s}) } = { f_{1},¼,f_{t} }.
The function OrbitRepresentativesForPlanarNearRing
returns precisely one set of representatives of cardinality i for each
isomorphism class of planar nearrings which can be generated from the
Ferrero pair ( G, phi ).
gap> C7 := CyclicGroup( 7 );; gap> i := GroupHomomorphismByFunction( C7, C7, x > x^1 );; gap> phi := Group( i );; gap> reps := OrbitRepresentativesForPlanarNearRing( C7, phi, 2 ); [ [ f1, f1^2 ], [ f1, f1^5 ] ] gap> n1 := PlanarNearRing( C7, phi, reps[1] );; gap> n2 := PlanarNearRing( C7, phi, reps[2] );; gap> IsIsomorphicNearRing( n1, n2 ); false
WdNearRing(
G,
psi,
phi,
reps )
Every finite (left) weakly divisible nearring (N,+,·) can be constructed in the following way:
(1) Let y be an endomorphism of the group (N,+) such that Ker y = Image y^{r1} for some integer r, r > 0. (Let y^{0} := id.)
(2) Let F be an automorphism group of (N,+) such that yF Í Fy and F acts fixedpointfree on N\ Image y. (That is, for each j Î F there exists j¢ Î F such that yj = j¢y and for all n Î N\ Image y the equality n^{j} = n implies j = id. Note that our functions operate from the right just like GAPmappings do.)
(3) Let E Í N be a complete set of orbit representatives for F on N\ Image y, such that for all e_{1}, e_{2} Î E, for all j Î F and for all 1 £ i £ r1 the equality e_{1}^{jyi} = e_{2}^{yi} implies jy^{i} = y^{i}.
Then for all n Î N, n ¹ 0, there are i ³ 0 ,j Î F and e Î E such that n = e^{jyi}; furthermore, for fixed n, the endomorphism jy^{i} is independent of the choice of e and j in the representation of n.
For all x Î N, e Î E,j Î F and i ³ 0 define 0·x : = 0
and

WdNearRing
returns the wd nearring on the group G as defined above
by the nilpotent endomorphism psi, the automorphism group phi and
a list of orbit representatives reps where the arguments fulfill the
conditions (1) to (3).
gap> C9 := CyclicGroup( 9 );; gap> psi := GroupHomomorphismByFunction( C9, C9, x > x^3 );; gap> Image( psi ); Group([ f2, <identity> of ... ]) gap> Image( psi ) = Kernel( psi ); true gap> a := GroupHomomorphismByFunction( C9, C9, x > x^4 );; gap> phi := Group( a );; gap> Size( phi ); 3 gap> orbs := Orbits( phi, C9 ); [ [ <identity> of ... ], [ f2 ], [ f2^2 ], [ f1, f1*f2, f1*f2^2 ], [ f1^2, f1^2*f2^2, f1^2*f2 ] ] gap> # choose reps from the orbits outside of Image( psi ) gap> reps := [orbs[4][1], orbs[5][1]]; [ f1, f1^2 ] gap> n := WdNearRing( C9, psi, phi, reps ); ExplicitMultiplicationNearRing ( <pc group of size 9 with 2 generators> , multiplication )
[Up] [Previous] [Next] [Index]
SONATA manual