Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.01004

Toward a unified theory for common affine roots of general sets of multivariate polynomials

Olav Geil
View original source ↗Read source document ↗Export metadata ↓

Abstract

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality having all the points as roots (interpolation theorem). Tao noted in [48] that the theory of multivariate polynomials is not yet sufficiently matured to provide similar theorems with an equally simple relation between them. In the present paper we argue that for general multivariate polynomials the right measure for the size of the polynomial should not be the degree, but the leading monomial. In this setting the footprint bound [27] becomes a natural enhancement of the factor theorem providing a bound on the number of common roots of general multivariate polynomials which is sharp for all finite Cartesian product point-sets. As our main contribution, by using methods from the theory of error-correcting codes we establish a natural formulation of the interpolation theorem to the case of common roots of multivariate polynomials. In short the two theorems reduce to the same result, but for dual spaces, establishing the unification requested in [48]. We leave it for further research to possibly establish similar interpolation results taking one or more of the various concepts of multiplicity of multivariate polynomials into account.

Explore related subjects

math.AC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olav Geil. 2026-05-18. Toward a unified theory for common affine roots of general sets of multivariate polynomials. https://arxiv.org/abs/2601.01004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On triviality of $\mathbb{A}^2$-forms admitting a nontrivial $\mathbb{G}_a$-action

T. Kambayashi had shown that $\mathbb{A}^2$-forms over separable field extensions are necessarily polynomial rings. However, there exist inseparable $\mathbb{A}^2$-forms which are not necessarily polynomial rings. In this paper, we give a structure theorem for $\mathbb{A}^2$-forms over arbitrary field extensions admitting a nontrivial $\mathbb{G}_a$-action. From this structure theorem we derive some conditions under which an $\mathbb{A}^2$-form becomes trivial. In particular, we prove that over a field $k$, a factorial $\mathbb{A}^2$-form having a $k$-rational point and a non-trivial $\mathbb{G}_a$-action is trivial and we also give examples demonstrating that none of these hypotheses can be discarded. As a consequence of the structure theorem, we obtain a generalization of the Zariski Cancellation Theorem for the affine plane over an arbitrary field.

math.AC↗
arXiv2026

Symbolic powers of the ideal of$n$ general points in $P^{n-1}$

Problem L of Fröberg--Lundqvist--Oneto--Shapiro asks for the difference between the Hilbert series of ordinary and symbolic powers of the ideal of general points in projective space. We solve this completely for \(n\) general points of \(\PP^{n-1}\). Besides a closed formula for \[ \HS(S/I^m)-\HS(S/I^{(m)}), \] we determine all minimal monomial generators of \(I^{(m)}\), and describe the symbolic Rees algebra. We also show that containment \(I^{(m)}\subseteq I^r\) is detected solely by initial degrees. This gives the exact containment threshold, the Waldschmidt constant \(\walpha\), the resurgence \(\Res\), and the asymptotic resurgence \(\aRes\): \[ \walpha(I)=\frac{n}{n-1}, \qquad \Res(I)=\aRes(I)=\frac{2(n-1)}{n}. \] We also take the first step beyond \(n\) points: for \(n+1\) general points of \(\PP^{n-1}\) --- again a rigid, non-monomial configuration --- we identify the defining quadrics, resolve the case \(n=3\) completely (a complete intersection, with \(J^{(m)}=J^m\) for all \(m\) and resurgence \(1\)), and propose an exact Waldschmidt-constant formula \(\walpha=\frac{n+1}{n-1}\) for all \(n\), verified computationally in every case we could check.

math.AC↗