2009
DOI: 10.1142/s0218196709005482
|View full text |Cite
|
Sign up to set email alerts
|

Buchsteiner Loops

Abstract: Buchsteiner loops are those which satisfy the identity x\(xy · z) = (y · zx)/x. We show that a Buchsteiner loop modulo its nucleus is an abelian group of exponent four, and construct an example where the factor achieves this exponent.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 25 publications
0
12
0
Order By: Relevance
“…If (Q, ⊕) possesses an identity element e, that is e satisfies e⊕g = g = g ⊕e for all g ∈ Q, then Q is called a loop. 2007 Hämäläinen and Cavenagh [66] Aut(L) 2007 Csörgő, Drápal and Kinyon [27]…”
Section: Quasigroupsmentioning
confidence: 99%
“…If (Q, ⊕) possesses an identity element e, that is e satisfies e⊕g = g = g ⊕e for all g ∈ Q, then Q is called a loop. 2007 Hämäläinen and Cavenagh [66] Aut(L) 2007 Csörgő, Drápal and Kinyon [27]…”
Section: Quasigroupsmentioning
confidence: 99%
“…Thus, Moufang loops can be studied by considering these and other autotopisms , Chapter V, a point of view that culminates in the theory of groups with triality . Other varieties of loops in which the defining identities have autotopic characterizations include conjugacy closed loops , extra loops , and Buchsteiner loops . A new, systematic look at the basic theory of loops defined in this way can be found in .…”
Section: Introductionmentioning
confidence: 99%
“…By [6], if Q is a Buchsteiner loop, then Q/Z(Q) is a conjugacy closed loop. The associator calculus developed in [8] (which is an earlier paper than [6]) can be formulated within such a theory, and this is also true for results of Section 1. The main results of this paper are independent of Proposition 2.1 since for them it suffices to know the statement only for 3-generated groups.…”
Section: Central Elements and An Odd Order Propositionmentioning
confidence: 95%
“…Hence |A(Q)| ≥ 8, and so Q/N has to be generated by at most two elements if |Q| ≤ 64. In such a case we can assume that Q is generated by two elements, by Corollary 2.5, and we can also assume that [ The proof is not difficult, and can be found, e. g., in [8].…”
Section: Central Elements and An Odd Order Propositionmentioning
confidence: 99%
See 1 more Smart Citation