Factorizations of finite groups
Abstract
A finite group G is called k-factorizable if for every ordered factorization |G|=a1·s ak into integers each greater than 1 there exist subsets A1,…,Ak⊂eq G such that |Ai|=ai for each i and G=A1·s Ak. The main results are as follows. 1. For every integer k≥3 there exists a finite group G such that G is not k-factorizable. 2. Let G be a finite group of order 4m. If a Sylow 2-subgroup of G is elementary abelian, all involutions of G are conjugate, and the centralizer of every involution has a normal Sylow 2-subgroup, then G has no factorization of the form G=ABC with |A|=|C|=2 and |B|=m. 3. Only 8 groups of order at most 100 fail to be k-factorizable for some k.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.