2024/01/17 by M. I. Kabenyuk, Kabenyuk, Mikhail · 1 citation
Engineering · Mathematics · Neuroscience · #20B30 #20D40 #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Nuclear Receptors and Signaling #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2401.09306
openalex publication_date 2024/01/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A finite group G is called k-factorizable if for any factorization |G|=a1⋯ ak with ai>1 there exist subsets Ai of G with |Ai|=ai such that G=A1⋯ Ak. We say that G is multifold-factorizable if G is k-factorizable for any possible integer k≥2. We prove that simple groups of orders 168 and 360 are multifold-factorizable and formulate two conjectures that the symmetric group Sn for any n and the alternative group An for n≥6 are multifold-factorizable.