Uniqueness and explicit computation of mates in near-factorizations

Donald L. Kreher, William J. Martin, Douglas R. Stinson

We show that a "mate'' $B$ of a set $A$ in a near-factorization $(A,B)$ of a finite group $G$ is unique. Further, we describe how to compute the mate $B$ very efficiently using an…