Table of Contents
Fetching ...

The Hilton-Milner type results of $(k, \ell)$-sum-free sets in $\mathbb F_p^n$

Xin Wei, Xiande Zhang, Gennian Ge

TL;DR

The paper develops a comprehensive Hilton–Milner type theory for (k,ℓ)-sum-free subsets of 𝔽_p^n, establishing the exact extremal size when p=(k+ℓ)m+2+λ and identifying ⌈(λ+1)/2⌉ extremal cuboids that achieve the (m+1)p^{n−1} bound. It proves sharp stability results: any nontrivial near-extremal set has size at most mp^{n−1}, and it classifies the nontrivial extremal structures in several parameter regimes, including explicit abnormal configurations (types 3–5) for certain (k+ℓ,λ) pairs. The argument integrates additive combinatorics with Fourier-analytic techniques and leverages progress towards the 3k−4 conjecture via a carefully defined T(c) parameter to control how large p must be. The results illuminate the structure of large sum-free sets over finite vector spaces, reveal new connections between inverse additive number theory and extremal problems, and lay groundwork for further exploration of Hilton–Milner type phenomena in related groups and parameter ranges.

Abstract

For a prime $p \equiv 2 \pmod 3$, it is well known that the largest sum-free subsets of $\mathbb{F}_p^n$ have size $\frac{p+1}{3} p^{n-1}$, and the extremal sets must be a cuboid of the form $\{\frac{p+1}{3}, \frac{p+1}{3}+1, \ldots, \frac{2p-1}{3}\} \times \mathbb{F}_p^{n-1}$ up to isomorphism. Recently, Reiner and Zotova proved a Hilton--Milner type stability result showing that for large $p$, any sum-free set not contained in the extremal cuboid has size at most $\frac{p-2}{3} p^{n-1}$, and all possible structures attaining this bound were classified. In this paper, we develop a general Hilton--Milner theory for $(k,\ell)$-sum-free sets in $\mathbb{F}_p^n$ for $k > \ell \ge 1$. We determine the maximum size of such sets for all $p \equiv μ\pmod{k+\ell}$ with $2 \le μ\le k+\ell-1$, and show that the extremal configurations are precisely $\lceil (μ-1)/2 \rceil$ non-isomorphic cuboids. Beyond the extremal regime, we prove sharp Hilton--Milner type stability results showing that, for all sufficiently large $p$, a $(k,\ell)$-sum-free set not contained in any of these extremal cuboids is uniformly bounded away from the maximum by a gap of order $p^{n-1}$, and we determine the full structure of all sets achieving this second-best bound in several broad parameter ranges. In particular, when $2 \le μ\le k+\ell-3$ (which is tight), only two structural types occur for all $k+\ell \ge 5$; and when $μ= 2$ or $3$, we obtain a complete classification for all $k > \ell \ge 1$. Our arguments combine additive combinatorics and Fourier-analytic methods, and make use of recent progress toward the long-standing $3k-4$ conjecture, highlighting new connections between inverse additive number theory and extremal problems over finite vector spaces.

The Hilton-Milner type results of $(k, \ell)$-sum-free sets in $\mathbb F_p^n$

TL;DR

The paper develops a comprehensive Hilton–Milner type theory for (k,ℓ)-sum-free subsets of 𝔽_p^n, establishing the exact extremal size when p=(k+ℓ)m+2+λ and identifying ⌈(λ+1)/2⌉ extremal cuboids that achieve the (m+1)p^{n−1} bound. It proves sharp stability results: any nontrivial near-extremal set has size at most mp^{n−1}, and it classifies the nontrivial extremal structures in several parameter regimes, including explicit abnormal configurations (types 3–5) for certain (k+ℓ,λ) pairs. The argument integrates additive combinatorics with Fourier-analytic techniques and leverages progress towards the 3k−4 conjecture via a carefully defined T(c) parameter to control how large p must be. The results illuminate the structure of large sum-free sets over finite vector spaces, reveal new connections between inverse additive number theory and extremal problems, and lay groundwork for further exploration of Hilton–Milner type phenomena in related groups and parameter ranges.

Abstract

For a prime , it is well known that the largest sum-free subsets of have size , and the extremal sets must be a cuboid of the form up to isomorphism. Recently, Reiner and Zotova proved a Hilton--Milner type stability result showing that for large , any sum-free set not contained in the extremal cuboid has size at most , and all possible structures attaining this bound were classified. In this paper, we develop a general Hilton--Milner theory for -sum-free sets in for . We determine the maximum size of such sets for all with , and show that the extremal configurations are precisely non-isomorphic cuboids. Beyond the extremal regime, we prove sharp Hilton--Milner type stability results showing that, for all sufficiently large , a -sum-free set not contained in any of these extremal cuboids is uniformly bounded away from the maximum by a gap of order , and we determine the full structure of all sets achieving this second-best bound in several broad parameter ranges. In particular, when (which is tight), only two structural types occur for all ; and when or , we obtain a complete classification for all . Our arguments combine additive combinatorics and Fourier-analytic methods, and make use of recent progress toward the long-standing conjecture, highlighting new connections between inverse additive number theory and extremal problems over finite vector spaces.
Paper Structure (21 sections, 43 theorems, 112 equations, 10 tables)

This paper contains 21 sections, 43 theorems, 112 equations, 10 tables.

Key Result

Theorem 1.1

Let $p=3m+2$ be a prime number with $m\geq 1$. If $A\subset\mathbb F_p^n$ is a sum-free set, then $|A|\le (m+1) p^{n-1}$. Moreover, if $|A|= (m+1) p^{n-1}$, $A$ is isomorphic to the following unique form, Here, the notation $[a,b]$ with $a,b\in \mathbb F_p$ means the set $\{a,a+1,\ldots,b\}$ in $\mathbb F_p$.

Theorems & Definitions (88)

  • Theorem 1.1: Yap1969
  • Theorem 1.2: Reiher2024
  • Theorem 1.3
  • Definition 1.1
  • Theorem 1.4: When $\lambda\in \lbrack 0, k+\ell-5 \rbrack$
  • Definition 1.2: When $\lambda= k+\ell-4$
  • Definition 1.3: When $(k+\ell,\lambda)=(5,1)$
  • Theorem 1.5: When $(k+\ell,\lambda)=(5,1)$
  • Definition 1.4: When $(k+\ell,\lambda)=(4,1)$
  • Theorem 1.6: When $(k+\ell,\lambda)=(4,1)$
  • ...and 78 more