Abstract
We introduce the abstract concept of supernilpotence in loop theory, and relate it to existing concepts, namely, central nilpotence and nilpotence of the multiplication group. We prove that the class of supernilpotence is greater or equal than the class of nilpotence of the multiplication group, and combining existing results, we show that a finite loop is supernilpotent if and only if its multiplication group is nilpotent. We also provide a new exposition of a classical result and crucial ingredient, that loops with a nilpotent multiplication group are centrally nilpotent and admit a prime decomposition.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
