Kernel--wreath constructions and infinite families of finite simple skew braces
Marco Damele
Abstract
We introduce a kernel--wreath construction for finite skew braces. Let C be a finite skew brace, write (C,+)=A and (C,)=R, and let χ:R T be an epimorphism onto a non-trivial finite abelian group. We show that a natural index-|T| kernel in the permutational wreath product R T acts regularly on AT, and hence defines a new skew brace T(C,χ) with additive group A|T|. The construction preserves every finite abelian quotient of the multiplicative group, as well as solvability, and contains the seed brace C as a diagonal subbrace. It can therefore be iterated indefinitely. More precisely, if Q is a non-trivial finite abelian quotient of R and p∈π(Q), then one obtains an infinite tower \[ C=C0 C1 C2·s \] with (Cm,+) Apm for every m≥0. Our main permanence result shows that if C is simple and is not a trivial skew brace, then T(C,χ) is again simple. Consequently, a single simple seed whose multiplicative group has a non-trivial finite abelian quotient gives rise to infinite families of finite simple skew braces. In particular, starting from suitable solvable regular subgroups of the holomorph of a finite non-abelian simple group S, we obtain infinite families of simple skew braces with additive groups Spm and solvable multiplicative groups. Further applications are given to the simple skew braces of order 12 and to Byott's family.
Create a lesson
Related papers
The variety generated by all additively idempotent semirings of order four
Mengya Yue, Xiaolei Shao
Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
Jiaping Lu
Explicit equational bases for the power semirings of S7
Mengya Yue, Miaomiao Ren, Zidong Gao
The free multiplicative Lie algebra L(P) for a finitely generated parafree group P
Dessislava H. Kochloukova
An order automorphism of a Dlab group not induced by conjugation
Ting Gong, Yong Yang, Michael Ruofan Zeng
Finite groups with large power-avoiding subsets
Simon R. Blackburn, Sarah B. Hart, Daniel McVeagh