Finite Nets, I. Numerical Invariants

1951 ◽  
Vol 3 ◽  
pp. 94-107 ◽  
Author(s):  
R. H. Bruck

A finite net N of degree k, order n, is a geometrical object of which the precise definition will be given in §1. The geometrical language of the paper proves convenient, but other terminologies are perhaps more familiar. A finite affine (or Euclidean) plane with n points on each line is simply a net of degree n+ 1, order n (Marshall Hall [1]). A loop of order n is essentially a net of degree 3, order n (Baer [1], Bates [1]). More generally, for , a set of k —2 mutually orthogonal n ⨯ n latin squares may be used to define a net of degree k, order n (and conversely) by paralleling Bose's correspondence (Bose [1]) between affine planes and complete sets of orthogonal latin squares.

1960 ◽  
Vol 12 ◽  
pp. 134-144
Author(s):  
W. R. Cowell

It is shown in (6) how to represent certain sets of orthogonal Latin squares as a group together with a set of permutations of the group elements. The correspondence between 3-nets and loops is well known; for example, see (8). We shall consider a loop G together with a certain set of permutations on the elements of G and shall interpret such a structure as an incidence system in which the 3-net of the loop is embedded. Specifically, the permutations or “adjoints” will give rise to lines which may be adjoined to the 3-net of G in the sense of (3). The group of autotopisms of the loop determines a group of automorphisms of its 3-net analogous to collineations in an affine plane. We shall study the problem of extending these incidence preserving mappings to the adjoined lines. By analogy with the study of loops with operators, we shall consider homomorphisms of loops with adjoints and examine geometric consequences. Particular attention will be paid to the case where G has the inverse property and the adjoints are “linear.” The special case in which G is an abelian group is of geometric interest in that the corresponding incidence systems include the Veblen-Wedderburn affine planes.


2011 ◽  
Vol 28 (2) ◽  
pp. 30-39 ◽  
Author(s):  
Seung Eun Lee ◽  
Yoon Seok Yang ◽  
G S Choi ◽  
Wei Wu ◽  
R Iyer

Sign in / Sign up

Export Citation Format

Share Document