Abstract
Let (L,⊕) be a loop, i.e., L is a set with a binary operation ⊕ such that for all a, b ∈ L the equations a ⊕ x = b and y ⊕ a = b have unique solutions x, y ∈ L, and such that there exists an element 0 ∈ L with a ⊕ 0 = 0 ⊕ a = a. The loop L is called a K-loop if the Bol identity
holds and the automorphic inverse property
is satisfied, where ⊖a is defined by a⊕ (⊖a) = 0. The Bol identity implies the equality of left and right inverse, i.e., (⊖a) ⊕ a = 0 as well. Thus the phrase “automorphic inverse property” has it’s usual meaning. See [5] for more on loops. In particular, the definition of Bruck-loop in [5, p. 120] is identical with the definition above.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Kiechle, K-loops from matrix groups over ordered fields I, Beiträge zur Geometrie und Algebra 33 (1995), TUM-M 9509, Technische Universität München, 23–33.
A. Kreuzer, Inner mappings of Bol loops, Beiträge zur Geometrie und Algebra 33 (1995), TUM-M 9509, Technische Universität München, 15–22.
A. Kreuzer, Beispiele endlicher und unendlicher K-Loops. Resultate Math. 23 (1993), 355–362.
A. Kreuzer & H. Wefelscheid, On K-loops of finite order. Resultate Math. 25 (1994), 79–102.
H. O. Pflugfelder, Quasigroups and Loops: Introduction. Heldermann-Verlag, Berlin 1990.
A. A. Ungar, Weakly associative groups. Resultate Math. 17 (1990), 149–168.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
Kiechle, H., Konrad, A. (1997). The Structure Group of Certain K-Loops. In: Saad, G., Thomsen, M.J. (eds) Nearrings, Nearfields and K-Loops. Mathematics and Its Applications, vol 426. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-1481-0_21
Download citation
DOI: https://doi.org/10.1007/978-94-009-1481-0_21
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-7163-5
Online ISBN: 978-94-009-1481-0
eBook Packages: Springer Book Archive