Near-factorizations of dihedral groups
Document Type
Article
Publication Date
1-1-2025
Abstract
We investigate near-factorizations of nonabelian groups, concentrating on dihedral groups. We show that some known constructions of near-factorizations in dihedral groups yield equivalent near-factorizations. In fact, there are very few known examples of nonequivalent near-factorizations in dihedral or other nonabelian groups; we provide some new examples with the aid of the computer. We also analyse a construction for near-factorizations in dihedral groups from near-factorizations in cyclic groups, due to Pêcher, and we investigate when nonequivalent near-factorizations can be obtained by this method.
Publication Title
Designs Codes and Cryptography
Recommended Citation
Kreher, D.,
Paterson, M.,
&
Stinson, D.
(2025).
Near-factorizations of dihedral groups.
Designs Codes and Cryptography.
http://doi.org/10.1007/s10623-025-01715-8
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p2/1966