Skip to main content Accessibility help
×
Home

Loops with Adjoints

  • W. R. Cowell (a1)

Extract

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.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Loops with Adjoints
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Loops with Adjoints
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Loops with Adjoints
      Available formats
      ×

Copyright

References

Hide All
1. André, Johannes, Ueber nicht-Desarguessche Ebenen mit transitiver Translationsgruppe, Math. Zeitschr., 60 (1954), 156186.
2. Bruck, R.H., Contributions to the theory of loops, Trans. Amer. Math. Soc, 60 (1946), 245354.
3. Bruck, R.H., Finite nets, I. Numerical invariants, Can. J. Math., 3 (1951), 94107.
4. Hall, Marshall, Projective planes, Trans. Amer. Math. Soc, 54 (1943), 229277.
5. Hughes, D.R., Planar division neo-rings, Trans. Amer. Math. Soc, 80 (1955), 502527.
6. Mann, Henry B., The construction of orthogonal Latin squares, Ann. Math. Stat., 13 (1942), 418423.
7. Paige, Lowell J., Neofields, Duke Math. J., 16 (1949), 3960.
8. Pickert, Gunter, Projektive Ebenen (Berlin, 1955).
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Loops with Adjoints

  • W. R. Cowell (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed