English

Zero testing and equation solving for sparse polynomials on rectangular domains

Rings and Algebras 2024-06-12 v1

Abstract

We consider sparse polynomials in NN variables over a finite field, and ask whether they vanish on a set SNS^N, where SS is a set of nonzero elements of the field. We see that if for a polynomial ff, there is cSN\mathbf{c}\in S^N with f(c)0f (\mathbf{c}) \neq 0, then there is such a c\mathbf{c} in every sphere inside SNS^N, where the radius of the sphere is bounded by a multiple of the logarithm of the number of monomials that appear in ff. A similar result holds for the solutions of the equations f1==fr=0f_1 = \cdots = f_r = 0 inside SNS^N.

Keywords

Cite

@article{arxiv.2305.19669,
  title  = {Zero testing and equation solving for sparse polynomials on rectangular domains},
  author = {Erhard Aichinger and Simon Grünbacher and Paul Hametner},
  journal= {arXiv preprint arXiv:2305.19669},
  year   = {2024}
}