5 citations · 10 across the 4 of their papers we have counts for
4 papers
Addition Theorems in Fp via the Polynomial Method
Eric Balandraud
In this article, we use the Combinatorial Nullstellensatz to give new proofs of the Cauchy-Davenport, the Dias da Silva-Hamidoune and to generalize a previous addition theorem of t…
Largest minimal inversion-complete and pair-complete sets of permutations
Eric Balandraud, Maurice Queyranne, Fabio Tardella
We solve two related extremal problems in the theory of permutations. A set of permutations of the integers 1 to is inversion-complete (resp., pair-complete) if for every i…
A nullstellensatz for sequences over F_p
Eric Balandraud, Benjamin Girard
Let p be a prime and let A=(a_1,...,a_l) be a sequence of nonzero elements in F_p. In this paper, we study the set of all 0-1 solutions to the equation a_1 x_1 + ... + a_l x_l = 0.…
Subset sums in abelian groups
Eric Balandraud, Benjamin Girard, Simon Griffiths +1
Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) i…