Document Type
Article
Publication Date
5-12-2026
Department
Department of Mathematical Sciences
Abstract
We initiate the study of λ-fold near-factorizations of groups with λ>1. While λ-fold near-factorizations of groups with λ=1 have been studied in numerous papers, this is the first detailed treatment for λ>1. We establish fundamental properties of λ-fold near-factorizations and introduce the notion of equivalence. We prove various necessary conditions of λ-fold near-factorizations, including upper bounds on λ. We present three constructions of infinite families of λ-fold near-factorizations, highlighting the characterization of two subfamilies of λ-fold near-factorizations. We discuss a computational approach to λ-fold near-factorizations and tabulate computational results for abelian groups of small order.
Publication Title
Designs Codes and Cryptography
Recommended Citation
Kreher, D. L.,
Li, S.,
&
Stinson, D.
(2026).
λ-fold near-factorizations of groups.
Designs Codes and Cryptography,
94(5).
http://doi.org/10.1007/s10623-026-01825-x
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p2/2642
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Version
Publisher's PDF
Publisher's Statement
© The Author(s) 2026. Publisher’s version of record: https://doi.org/10.1007/s10623-026-01825-x