Papers
Topics
Authors
Recent
Search
2000 character limit reached

λλ-fold near-factorizations of groups

Published 12 Mar 2025 in math.GR and math.CO | (2503.09325v2)

Abstract: We initiate the study of λ\lambda-fold near-factorizations of groups with $\lambda > 1$. While λ\lambda-fold near-factorizations of groups with λ=1\lambda = 1 have been studied in numerous papers, this is the first detailed treatment for $\lambda > 1$. We establish fundamental properties of λ\lambda-fold near-factorizations and introduce the notion of equivalence. We prove various necessary conditions of λ\lambda-fold near-factorizations, including upper bounds on λ\lambda. We present three constructions of infinite families of λ\lambda-fold near-factorizations, highlighting the characterization of two subfamilies of λ\lambda-fold near-factorizations. We discuss a computational approach to λ\lambda-fold near-factorizations and tabulate computational results for abelian groups of small order.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.