English

A nullstellensatz for sequences over F_p

Combinatorics 2017-10-05 v2 Number Theory

Abstract

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. We prove that whenever l >= p, this set actually characterizes A up to a nonzero multiplicative constant, which is no longer true for l < p. The critical case l=p is of particular interest. In this context, we prove that whenever l=p and A is nonconstant, the above equation has at least p-1 minimal 0-1 solutions, thus refining a theorem of Olson. The subcritical case l=p-1 is studied in detail also. Our approach is algebraic in nature and relies on the Combinatorial Nullstellensatz as well as on a Vosper type theorem.

Cite

@article{arxiv.1204.0373,
  title  = {A nullstellensatz for sequences over F_p},
  author = {Eric Balandraud and Benjamin Girard},
  journal= {arXiv preprint arXiv:1204.0373},
  year   = {2017}
}

Comments

23 pages

R2 v1 2026-06-21T20:43:23.665Z