Abstract: A commutative loop is Jordan if it satisfies the identity . Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order exists if and only if and . We also consider whether powers of elements in Jordan loops are well-defined, and we construct an infinite family of finite simple nonassociative Jordan loops.
Recommendations
- Jordan loops and loop rings.
- A note on loops of square-free order.
- Powers of elements in Jordan loops.
- scientific article; zbMATH DE number 2061594
- Order Relation in Jordan Rings and a Structure Theorem
- On \(K\)-loops of finite order
- Cyclic orders defined by ordered Jordan algebras
- On commutative A-loops of order PQ
- A solvability criterion for finite loops.
- On loops whose inner permutations commute.
Cites work
- A taste of Jordan algebras
- Amalgam of a loop over an idempotent quasigroup.
- scientific article; zbMATH DE number 3132783 (Why is no real title available?)
- scientific article; zbMATH DE number 47663 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- Jordan loops and loop rings.
- Powers of elements in Jordan loops.
- Some Results in the Theory of Linear Non-Associative Algebras
Cited in
(6)
This page was built for publication: Admissible Orders of Jordan Loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3619604)