Let B1, . . ., Bk be the subsets of a finite non-abelian group G such that G = B1 . . . Bk, where k ≥ 2. If |G| = |B1|. . .Bk|, or equivalently, the group multiplication map B1 ×. . .× BkG is a bijection, then G = B1 . . . Bk is a k-fold factorization of G. Let Sn and An be the symmetric group and the alternating group of degree n respectively. We show some constructions of k-fold factorizations of Sn involving Sn−1 and An, where k = 2, 3, . . ., n− 1. In addition, the m-th power of the permutation (1, 2, . . ., n) is studied to form the elements in the factorization subsets, for 2 ≤ mn− 1.

1.
G.
Hajós
, “
Covering multidimensional spaces by cube lattices
,”
Mat. Fiz. Lapok
45
,
171
190
(
1938
).
2.
G.
Hajós
, “
Über einfache und mehrfache bedeckung desn-dimensionalen raumes mit einem würfelgitter
,”
Mathematische Zeitschrift
47
,
427
467
(
1942
).
3.
S.
Szabó
and
A. D.
Sands
,
Factoring groups into subsets
(
Chapman and Hall/CRC
,
2009
).
4.
G. M.
Bergman
, “
A note on factorizations of finite groups
,” arXiv preprint arXiv:2003.12866 (
2020
).
5.
R.
Bildanov
,
V.
Goryachenko
, and
A.
Vasil'ev
, “
Factoring nonabelian finite groups into two subsets
,” arXiv preprint arXiv:2005.12003 (
2020
).
6.
K. Corrádi and S.
Szabó
, “
Direct products of subsets in a finite abelian group
,”
Acta Mathematica Hungarica
138
,
226
236
(
2013
).
7.
Y.
Cong
,
H.
Hong
,
J.
Shao
,
S.
Han
,
J.
Lin
, and
S.
Zhao
, “
A new secure encryption scheme based on group factorization problem
,”
IEEE Access
7
,
168728
168735
(
2019
).
8.
H.
Huang
,
B.
Xia
, and
S.
Zhou
, “
Perfect codes in cayley graphs
,”
SIAM Journal on Discrete Mathematics
32
,
548
559
(
2018
).
9.
H. M.
Green
and
M. W.
Liebeck
, “
Some codes in symmetric and linear groups
,”
Discrete Mathematics
343
,
111719
(
2020
).
10.
K.
Bogart
,
Introductory Combinatorics
(
Harcourt/Academic Press
,
2000
).
This content is only available via PDF.
You do not currently have access to this content.