🔢 mathematics

Restricted sums of sets of cardinality $2p + 1$ in $\mathbb{Z}_p^2$

This paper proves that for any subset $A \subseteq \mathbb{Z}_p^2$ with $|A| = 2p + 1$ (where $p \geq 5$ is prime), the size of its restricted sumset $A\hat{+}A$ is at least $4p$ , marking the first significant progress in over twenty years on this specific variant of the Erdős-Heilbronn problem.

Original authors: Jacinda Terkel

Published 2026-02-10

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Jacinda Terkel

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Mystery of the "Exclusive" Dinner Party

Imagine you are organizing a massive, high-stakes dinner party in a city where everyone lives in a very specific, mathematical grid (this is our group, $\mathbb{Z}_2^p$ ).

In this city, there are strict rules about how people interact. You have invited exactly $2p + 1$ guests. Now, you want to create "pairings" for a special activity. But there’s a catch: you cannot pair a person with themselves. This is what mathematicians call a "restricted sumset." It’s like saying, "I want to see all the possible unique combinations of two different guests, but I won't count a guest dancing with themselves."

The big question this paper asks is: "What is the absolute minimum number of unique pairs we can possibly end up with?"

The Mathematical "Social Butterfly" Problem

In additive combinatorics (the field this paper belongs to), mathematicians try to figure out how much "variety" is created when you combine sets.

If you have a group of people and you let them mingle, you expect a lot of different combinations to emerge. If everyone is a "social butterfly," you get a huge number of unique pairs. But if everyone is very "cliquey"—meaning they all belong to the same small, tight-knit families or neighborhoods—the number of unique pairs stays very low.

For over 20 years, mathematicians have been trying to find the "floor"—the lowest possible number of unique pairs that can exist, no matter how much the guests try to stay in their cliques.

The Breakthrough: Breaking the 20-Year Silence

For a long time, we knew the answer for small groups, but when the group size hit a specific "awkward" number ( $2p + 1$ ), the math became a nightmare. It was like trying to predict the social dynamics of a crowd that is too big to manage easily, but too small to follow standard patterns.

Jacinda Eva Terkel’s paper finally cracks this nut. She proves that for this specific group size, the number of unique pairs will always be at least $4p$ .

She has essentially proven that even if the guests try their hardest to stay in their cliques and minimize variety, the "mathematical friction" of the city forces at least $4p$ unique combinations to happen.

How She Did It: The "Neighborhood" Strategy

To solve this, Terkel used a strategy of "Dividing and Conquering" through neighborhoods (which mathematicians call cosets).

Imagine the city is divided into $p$ distinct neighborhoods. Some neighborhoods are crowded, and some are nearly empty. Terkel looked at all the possible ways the $2p + 1$ guests could be distributed among these neighborhoods:

The "One Big Crowd" Scenario (Case 1A): One neighborhood is packed with people, and the others are mostly empty. She used a "logic trap" to show that even in this extreme case, the variety still hits the $4p$ mark.
The "Spread Out" Scenario (Case 1B): The guests are somewhat evenly distributed. She proved that the sheer number of different neighborhood combinations creates enough variety to hit $4p$ .
The "Super-Clique" Scenario (Case 2): A few neighborhoods are extremely crowded. She used a "brute force" mathematical approach to show that these massive cliques actually create more variety than expected because they collide with each other so intensely.

Why Does This Matter?

While this might seem like a game of musical chairs with numbers, this kind of math is the foundation for Information Theory and Cryptography.

Understanding how sets combine and how much "variety" or "entropy" they produce is exactly how we design secure codes. If we know the minimum amount of variety a system can produce, we can better understand how to hide information or how to detect patterns in complex data.

In short: Terkel found the mathematical "floor" for social variety in a specific type of digital universe, ending a two-decade-long stalemate.

Technical Summary: Restricted Sums of Sets of Cardinality $2p + 1$ in $\mathbb{Z}_2^p$

1. Problem Statement

The paper addresses a specific problem in additive combinatorics concerning the minimum size of a restricted sumset. Given an abelian group $G$ and a subset $A \subseteq G$ , the restricted sumset is defined as $2\hat{A} = \{a_1 + a_2 \mid a_1, a_2 \in A, a_1 \neq a_2\}$ .

The central objective is to determine the value of the function:
$\rho(G, m) = \min\{|2\hat{A}| : A \subseteq G, |A| = m\}$
Specifically, the author focuses on the case where $G$ is an elementary abelian $p$ -group of rank 2 ( $\mathbb{Z}_2^p$ ) and the cardinality of the set $A$ is $m = 2p + 1$ for a prime $p \geq 5$ . This specific case had remained unsolved for over two decades following the foundational work of Eliahou and Kervaire.

2. Methodology

The author employs a structural approach by partitioning the set $A$ into cosets of a non-trivial proper subgroup $H \cong \mathbb{Z}_p$ . This allows the problem to be analyzed through the lens of the distribution of elements across these cosets.

Key mathematical tools used include:

Cauchy-Davenport Theorem: Provides lower bounds for the size of unrestricted sumsets in $\mathbb{Z}_p$ .
Dias Da Silva and Hamidoune Theorem: Provides lower bounds for restricted sumsets in $\mathbb{Z}_p$ .
Vosper’s Theorem: A critical "inverse theorem" used to characterize sets that achieve small sumset sizes (specifically, arithmetic progressions with a common difference).

The proof is structured into two primary cases based on the size of the intersection of $A$ with the "base" coset $H_0$ (denoted $A_0$ ):

Case 1 ( $|A_0| \leq \frac{p+1}{2}$ ): This is further subdivided into Case 1A (where the number of non-empty cosets $m$ is large) and Case 1B (where $m$ is small). In Case 1A, the author uses the properties of arithmetic progressions and recurrence relations to show that if the sumset is small, the set must have a highly constrained structure, eventually leading to a contradiction or a reduction to other cases.
Case 2 ( $|A_0| \geq \frac{p+3}{2}$ ): Here, the author utilizes the fact that the restricted sumset within the base coset ( $2\hat{A}_0$ ) must already be large (specifically, $|2\hat{A}_0| = p$ ). The proof then proceeds by analyzing the number of cosets ( $\ell$ ) that satisfy certain sumset size thresholds, using a "brute force" exhaustion of possible values for $\ell$ (from $0$ to $3$).

3. Key Contributions and Results

Main Theorem: The paper proves that for any prime $p \geq 5$ , the minimum size of the restricted sumset for a set of size $2p+1$ in $\mathbb{Z}_2^p$ is exactly $4p$ :
$\rho(\mathbb{Z}_2^p, 2p + 1) = 4p$
Advancement of the Erdős-Heilbronn Problem: This result represents the first significant progress in over 20 years on this specific variant of the Erdős-Heilbronn problem for elementary abelian $p$ -groups.
Structural Insights: The paper provides a roadmap for the "inverse problem"—identifying the exact structure of sets $A$ that achieve this minimum bound.

4. Significance and Future Directions

The paper is significant because it bridges a long-standing gap in the classification of small sumsets in non-cyclic abelian groups.

The author proposes two major avenues for future research:

Generalization of the Group: Extending the result from $\mathbb{Z}_2^p$ to $\mathbb{Z}_r^p$ (the general elementary abelian $p$ -group case). The author conjectures that $\rho(\mathbb{Z}_r^p, 2p + 1) = 4p$ holds for sufficiently large $p$ .
Generalization of the Set Size: Determining $\rho(\mathbb{Z}_2^p, kp + 1)$ for $k \geq 3$ . The author conjectures that the general formula is $\rho(\mathbb{Z}_2^p, kp + 1) = 2kp$ .
The Inverse Problem: The paper concludes with a conjecture regarding the structure of the extremal sets (those where $|2\hat{A}| = 4p$ ), suggesting they consist of a union of two cosets of a subgroup $Z$ , plus one additional element, such that their image in the quotient group forms an arithmetic progression of length three.