Every finite nilpotent loop has a supernilpotent loop as reduct

DOI10.1007/S00025-025-02568-2MaRDI QIDQ6874608zbMATH OpenFDO

Authors Michael Kompatscher, Peter Mayr

Publication date 15 January 2026

Published in Results in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00025-025-02568-2

zbMATH Keywords

loopnilpotencenilpotent loopreductsubloop seriessupernilpotencesupernilpotent loop

Mathematics Subject Classification ID

Loops, quasigroups (20N05)

Review text

The authors prove that every finite nilpotent loop admits a loop reduct that is supernilpotent. While nilpotence and supernilpotence coincide for groups, they differ substantially in the case of loops. In particular, nilpotent loops need not decompose as direct products of prime power order loops. The main theorem establishes that this obstruction can be overcome at the level of reducts by constructing an alternative binary operation under which the loop becomes supernilpotent. The proof proceeds by refining a central series with prime power factors and inductively modifying the multiplication via term operations. As applications, the authors obtain several results on equational theories. For instance, they prove that every nilpotent loop of order \(pq\) for primes \(p, q\) has a finite equational basis. They also discuss abelian reducts of groups.

Cites work

• Clonoids between modules
• Closed sets of finitary functions between finite fields of coprime order
• Commutator theory for loops.
• Contributions to the Theory of Loops
• Enumeration of nilpotent loops via cohomology.
• Finite group theory.
• Groups with abelian central quotient group.
• Higher commutator theory for congruence modular varieties
• scientific article; zbMATH DE number 3832016 (Why is no real title available?)
• scientific article; zbMATH DE number 4035895 (Why is no real title available?)
• scientific article; zbMATH DE number 3328200 (Why is no real title available?)
• Is supernilpotence super nilpotence?
• On the multiplication group of a loop
• On the number of finite Mal'tsev algebras
• Some applications of higher commutators in Mal'cev algebras
• Some nuances of many-sorted universal algebra: a review
• Supernilpotence need not imply nilpotence
• Supernilpotence prevents dualizability
• Supernilpotent groups and 3-supernilpotent loops
• The structure of finite algebras
• Three concepts of nilpotence in loops
• Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
• Vaughan-Lee's nilpotent loop of size 12 is finitely based

This page was built for publication: Every finite nilpotent loop has a supernilpotent loop as reduct

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874608)