Asymptotic behaviour of minimal complements

Arindam Biswas, Jyoti Prakash SahaarXiv 2020 · DOI · arXiv

TL;DR

This paper delves into the fascinating world of "minimal complements" in group theory, a concept analogous to metric nets. The authors explore the "inverse problem" – which sets can act as minimal complements – and then investigate the asymptotic behavior of these sets as group sizes grow. They establish new theoretical results and pose open questions about the distribution and properties of minimal complements in various types of groups.

What Problem Does This Paper Address?

The paper tackles the "inverse problem" for minimal complements in group theory. Introduced by Nathanson, a minimal complement $W'$ to a set $W$ in a group $G$ satisfies $W \cdot W' = G$, and no proper subset of $W'$ also satisfies this. The direct problem asks for which $W$ and $W'$ this holds. The inverse problem, however, asks: for a given group $G$, which subsets can be minimal complements? While it's known that every non-empty subset of a finite group admits a minimal complement, the question of whether any non-empty subset can occur as a minimal complement is more nuanced and has a negative answer. This paper focuses on understanding which sets can be minimal complements and, crucially, how their properties behave asymptotically as the size of the group grows.

Methods

The paper builds upon existing results in additive combinatorics and group theory. Key methods include:

  • Direct Proofs: Constructing specific sets or demonstrating properties through logical deduction. For instance, Theorem 3.1 provides conditions under which a set is a minimal right complement.
  • Leveraging Existing Theorems: The authors frequently cite and extend results from prior works (e.g., [AKL20], [BL20], [BS19b]) to prove their theorems and corollaries. This includes adapting proofs from abelian groups to general groups.
  • Asymptotic Analysis: A significant portion of the paper is dedicated to understanding the behavior of sets as the group order $n$ approaches infinity. This involves analyzing the density and distribution of minimal complements within the set of all possible subsets.
  • Probabilistic Methods (Implicit): While not explicitly framed as probabilistic, the questions about the density of minimal complements and their intersection with specific regions (e.g., in Question 4 and 8) hint at probabilistic interpretations.

Datasets

Not discussed in the paper. The paper deals with theoretical results in abstract algebra and does not involve empirical data or specific datasets.

Key Insights and Ideas

  • "Large" vs. "Small" Subsets: The paper highlights a dichotomy: "large" subsets often cannot be minimal complements, while "small" subsets often can. This is a recurring theme in the study of additive structures.
  • Infinite Groups are Generous: A key result (Corollary 1.2) shows that any non-empty finite subset of an infinite group is a minimal complement. This is a strong statement about the richness of minimal complements in infinite settings.
  • Structure of Minimal Complements: The paper investigates how minimal complements can be constructed or combined. Theorem 1.3, for example, shows how to form a larger minimal complement from smaller ones in $\mathbb{Z}^d$.
  • Asymptotic Density is Key: The core of the later sections is understanding the asymptotic behavior of sets related to minimal complements. Questions are posed about their density, the limits of their sizes, and their distribution within intervals. This suggests a connection to measure theory and probability on $[0,1]$.

Key Results

  • Theorem 1.1 & Corollary 1.2: If a finite subset $C$ of a group $G$ is "large enough" relative to $|G|$ (specifically, $|G| > |C|^5 - |C|^4$), then $C$ is a minimal complement. This implies that any finite subset of an infinite group is a minimal complement.
  • Theorem 1.3: Provides a construction for creating larger minimal complements in $\mathbb{Z}^d$ from existing ones, under certain conditions related to size and modular arithmetic.
  • Asymptotic Behavior of $S_n^*$ and $A_n^*$: The paper analyzes the growth rate of sets of integers $k$ for which subsets of size $k$ are minimal complements in groups of order $n$. For cyclic groups, it's shown that $S_n = \{1, 2, \dots, \lfloor 2n/3 \rfloor, n\}$ for $n \ge 2$.
  • Open Questions on Distribution: The paper poses several detailed questions (Questions 4-13) about the asymptotic distribution of minimal complements and co-minimal pairs within intervals and squares, often framed in terms of convergence of ratios and probability measures.

Limitations and Future Work

  • Open Questions: The paper explicitly poses numerous open questions (e.g., Questions 1-13) regarding the precise asymptotic behavior and distribution of minimal complements and co-minimal pairs across various classes of groups. These represent significant avenues for future research.
  • Generalization Challenges: While some results are extended from abelian to general groups, the paper notes that proving results for arbitrary groups can be more challenging.
  • Specific Group Classes: Much of the asymptotic analysis is focused on specific classes of groups (cyclic, abelian, nilpotent, etc.). Extending these results to broader classes of groups remains an open area.
  • "Large Enough" vs. Precise Bounds: While some theorems provide sufficient conditions for a set to be a minimal complement (e.g., Theorem 1.1), finding sharp or necessary and sufficient conditions is often difficult and remains an active research area.

Summary updated

Abstract

The notion of minimal complements was introduced by Nathanson in 2011 as a natural group-theoretic analogue of the metric concept of nets. Given two non-empty subsets $W,W'$ in a group $G$, the set $W'$ is said to be a complement to $W$ if $W\cdot W'=G$ and it is minimal if no proper subset of $W'$ is a complement to $W$. The inverse problem asks which sets may or not occur as minimal complements. We show some new results on the inverse problem and investigate how the study of the inverse problem naturally gives rise to questions about the asymptotic behaviour of these sets, providing partial answers to some of them.
BibTeX
@misc{biswas2020asymptotic,
  author = {Arindam Biswas and Jyoti Prakash Saha},
  title = {{Asymptotic behaviour of minimal complements}},
  year = {2020},
  eprint = {2007.14389},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2007.14389},
}

Loading related content...

Figure