Unified Common-Root and Interpolation Bounds Based on Leading Monomial Data
Abstract
For general fields the footprint bound from Gröbner basis theory estimates the number of common affine roots of any set of multivariate polynomials using information on their leading monomials. In this paper we develop an interpolation bound with a similar flavor extending a previously known result for only a single polynomial to any prescribed number of polynomials. Surprisingly, our interpolation theorem and the footprint bound can be shown to be two sides of the same coin, solving similar problems, but for dual spaces. As discussed the footprint bound compares well with the improved Alon-Füredi bound and for finite fields the presented interpolation theorem is sharp. Our work can be viewed as a comment to a question raised by Tao in [Tao, 2014]
Fields of Study & Subjects
Polynomial and algebraic computation
Coding theory and cryptography
Tensor decomposition and applications
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 2 January 2026
- Document type
- Preprint