Skip to main content

Commutative Moufang Loops

  • Chapter
A Survey of Binary Systems

Part of the book series: Ergebnisse der Mathematik und ihrer Grenzgebiete ((MATHE1,volume NF 20))

  • 366 Accesses

Abstract

Bol [66] was the first to construct a commutative Moufang loop which is not an abelian group. Each of Bol’s examples is centrally nil-potent of class 2. Bruck [70] showed how to construct examples which are centrally nilpotent of class 3. In his University of Wisconsin thesis (1953), T. Slaby formulated the following theorem: Every commutative Moufang loop which can be generated by n elements (n > 1) is centrally nilpotent of class at most n — 1. In collaboration with the author, Slaby proved this theorem for n = 4, 5 as well as for the previously known cases n = 2, 3.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1971 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bruck, R.H. (1971). Commutative Moufang Loops. In: A Survey of Binary Systems. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol NF 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43119-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43119-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-42837-5

  • Online ISBN: 978-3-662-43119-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics