Additive Basis Conjecture in Finite Fields
- The Additive Basis Conjecture is the problem of determining if the union of a bounded number of linear bases in GF(p)^n forms an additive basis via 0–1 combinations.
- It connects additive combinatorics, permanent-rank methods, and graph-flow theory, with previous results offering logarithmic bounds in the space dimension.
- Yang Yu’s result for GF(3), showing that four bases suffice to span the space, bridges algebraic techniques with graph theory and reinforces the conjecture’s significance.
The Additive Basis Conjecture, in the sense of Jaeger–Linial–Payan–Tarsi, asks whether for each prime there exists a constant such that in every vector space over , the multiset-union of any linear bases is an additive basis, meaning that its $0$–$1$ span equals . The conjecture belongs to a line of work linking additive combinatorics over finite fields, permanent-rank phenomena, and graph-flow theory. A recent milestone is Yang Yu’s proof that in the union of any four linear bases is an additive basis, establishing the case with 0 and yielding an alternative proof of the weak 1-flow conjecture (Yu, 1 Oct 2025).
1. Definition and formal formulation
Let 2, where 3 is prime. A multiset 4 is called an additive basis if every 5 can be written in the form
6
Equivalently, the 7–8 span of 9 is the whole space. In the conjectural setup, one starts with several linear bases 0 of 1 and asks whether their multiset-union is automatically an additive basis once 2 is large enough but depends only on 3, not on 4 (Yu, 1 Oct 2025).
The conjecture was formulated in this form by Jaeger–Linial–Payan–Tarsi and was already associated earlier to Alon–Linial–Meshulam. Its qualitative content is that repeated linear spanning should force much stronger 5–6 spanning after a bounded number of repetitions. A related weakening, proposed by Szegedy, allows coefficients in 7 rather than 8: for every odd prime 9, one asks whether there is a constant 0 such that whenever 1 is the union of 2 linear bases, every 3 can be written as 4 with all 5 (Nagy et al., 2021).
2. Historical bounds and partial progress
Before the constant-bound question was settled for any specific prime, the main general progress was logarithmic in the dimension. Alon–Linial–Meshulam proved that if 6 are linear bases and 7, then 8 provided
9
so 0 for fixed 1. Hatami and de Quehen later generalized the paradigm to arbitrary finite abelian groups: if 2 satisfy 3 for each 4, then 5 once
6
In the special case 7, this again yields an 8 regime. The same exposition notes that simple examples show 9 is necessary in the vector-space problem (Hatami et al., 2016).
A different partial resolution concerns sparse-support bases. Esperet, de Joannis de Verclos, Le, and Thomassé proved the conjecture in the regime where every vector has support size at most $0$0. More precisely, if $0$1 are bases of $0$2, each vector in the union has support size at most $0$3, and there are at most $0$4 distinct shadows of size $0$5, then
$0$6
suffices for the union to be an additive basis. This produced a universal bound in the support-$0$7 case and connected the conjecture to modulo-orientation theorems and highly edge-connected graph flows (Esperet et al., 2017).
For the weak version, Nagy, Pál, and Tomon proved a strong form. For every prime $0$8, there exists a set $0$9 of size $1$0 such that whenever $1$1 is the union of $1$2 linear bases, the dilated set
$1$3
is an additive basis of $1$4. The same paper also shows that for $1$5, the union of only $1$6 bases already suffices if arbitrary nonzero coefficients are allowed (Nagy et al., 2021).
3. The $1$7 theorem
Yu’s theorem for $1$8 gives the first constant-value resolution of the original conjecture for a specific prime: $1$9 In the formulation used in the paper, this implies that the multiset-union of any four bases is an additive basis, and hence 0 (Yu, 1 Oct 2025).
The significance of this result is twofold. First, it converts the previously known logarithmic dependence on 1 into an exact constant for 2. Second, it closes a graph-theoretic loop already emphasized by Jaeger–Linial–Payan–Tarsi: the 3 additive-basis statement implies the weak 4-flow conjecture for graphs. Yu’s argument therefore supplies an alternative proof of Thomassen’s 2012 theorem on weak 5-flows, but now through a purely algebraic route rather than a graph-theoretic one (Yu, 1 Oct 2025).
The theorem is also structurally notable because its proof does not proceed by direct sumset expansion or Fourier-analytic estimates. Instead, it passes through a permanent-rank criterion for a block matrix and then through an induction in a truncated polynomial algebra. That proof architecture is unusually algebraic even by the standards of additive combinatorics over finite fields.
4. Proof architecture: permanent rank and truncated polynomial algebra
The first stage is a reduction via the Combinatorial Nullstellensatz. Let 6 be nonsingular 7 matrices over a field of characteristic 8, and form the 9 block matrix
0
Yu shows that if 1 has full permanent rank, meaning that some 2 submatrix has nonzero permanent, then the union of the four row-bases 3 is an additive basis of 4. The core algebraic statement is therefore the block-matrix theorem asserting that 5 has full permanent rank whenever 6 are nonsingular (Yu, 1 Oct 2025).
The second stage takes place in the truncated polynomial ring
7
graded by degree. If 8 is a linear-form space, one defines 9 for 0, and for 1,
2
The proof introduces division and remainder operators by a linear form, together with a generalized remainder 3, in order to control the ideals 4 generated by 5 and the annihilator spaces
6
Two preparatory results drive the induction. Theorem 5 identifies kernels and images for a single linear form 7 under support hypotheses: 8 provided 9 is at least 00 or 01, respectively. Lemma 6 is a dimension/support splitting statement: if 02 covers an increasing sequence 03 in the sense that 04, then for each 05 one can choose a 06-dimensional subspace 07 covering the tail 08 (Yu, 1 Oct 2025).
These ingredients feed Theorem 7, a kernel–image duality statement involving the subspace 09 spanned by all 10-fold products of elements of 11. Under the support lower bounds
12
the theorem gives
13
and a companion equality in high degree. Taking 14 yields 15, hence a nonzero permanent and full permanent rank. Since the row-forms associated with 16 satisfy 17, the criterion applies and closes the proof (Yu, 1 Oct 2025).
5. Related conjectures using the same or a similar label
The phrase “additive basis conjecture” is used for several distinct problems. In the finite-integer 18-basis problem, one studies finite 19 such that 20 contains 21 but not 22. Here the conjectural asymptotic ceiling is
23
where 24 is the maximum range of a 25-basis of size 26. Kohonen improved the explicit lower bound to
27
by a generalized Mrose construction (Kohonen, 2016).
In another direction, the Erdős–Turán additive-basis conjecture concerns infinite 28 with 29 for all sufficiently large 30, where
31
and predicts
32
Agama’s 2020 paper proves several variants under density and energy hypotheses, while the generalized circle-of-partition paper formulates Corollary 2.6 as a proof under the condition 33 for some 34 and all large 35 (Agama, 2020, Agama, 2017).
A further variant arises for finite abelian groups through the invariant 36, the least 37 such that every regular sequence 38 over 39 with 40 is an additive basis in the sense 41. Gao and Peng conjectured that 42. For rank 43, this was confirmed in the generic case
44
where the value is
45
and earlier exact progress included
46
These are sequence-sumset problems rather than the finite-field basis-union problem of Jaeger–Linial–Payan–Tarsi (Gao et al., 2021, Qu et al., 2021).
Finally, Bukh, van Hintum, and Keevash formulated a geometric additive-basis conjecture over 47 and its strengthened version: if 48 for a basis 49 and 50, then 51. Xu proved the full strengthened statement over 52, for arbitrary bases 53, and showed that the bound is sharp for every 54 and every 55 (Xu, 11 May 2026).
6. Open directions
Despite the 56 theorem, the original constant-bound conjecture remains open for general prime 57. Yu explicitly notes that a conjecture on permanent rank of a 58-block matrix would imply 59 in general, and that his method already yields an 60 bound for arbitrary 61. He also emphasizes that extending the constant-bound result beyond 62 appears to require new ideas in the truncated-polynomial framework, specifically analogues of the single-form kernel/image theorem and the dimension/support splitting lemma for larger 63 (Yu, 1 Oct 2025).
The weak theory suggests a complementary route. Nagy, Pál, and Tomon show that the weak conjecture can be solved with 64 bases plus a multiplier set 65 of size 66, and that for 67 only 68 bases suffice with arbitrary nonzero coefficients. Their paper remarks that progress on arithmetic-like multiplier sets of constant size might translate into progress on the original conjecture (Nagy et al., 2021).
In the graph-theoretic direction, the support-69 case already yields strong list-flow and antisymmetric-flow theorems in highly edge-connected graphs, but the unrestricted-support problem is still open. This suggests that the full conjecture may require either a higher-dimensional analogue of the graph-connectivity machinery used in the sparse-support regime or a further refinement of the polynomial and permanent-rank methods that proved decisive for 70 (Esperet et al., 2017).