Contents

-

Near-factors of Finite Groups

D. de Caen1, D.A. Gregory1, I.G. Hughes1, D.L. Kreher 2
1Department of Mathematics and Statistics Queen’s University Kingston, Ontario, Canada K7L 3N6
2School of Computer Science Rochester Institute of Technology Rochester, N.Y. 14623

Abstract

Let S and T be subsets of a finite group G with identity e, We write Ge=ST if every non-identity element g can be written uniquely as g=st with sS and tT. These near-factorizations are motivated by the combinatorial problem of
finding (0,1)-matrix factorizations of the matrix JI. We derive some results on near-factors S and T. For example, S and T each generate G. Also, if G is abelian, then the automorphism gg1 is a multiplier of both S and T. If the elementary abelian group Cpn (p an odd prime) is a homomorphic image of G, then |S|p1|T|p11(modp). These structure theorems suggest that noncyclic abelian groups rarely have near-factorizations. Constructions of near-factorizations are given for cyclic groups and dihedral groups.