pith. sign in

arxiv: 1204.0373 · v2 · pith:JOPHKGEInew · submitted 2012-04-02 · 🧮 math.CO · math.NT

A nullstellensatz for sequences over F_p

classification 🧮 math.CO math.NT
keywords caseequationnonzeronullstellensatzprovesolutionstheoremwhenever
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.