arXiv · 2608.24504
The Aron--Rueda zero-subspace problem
Abstract
We determine the exact finite-dimensional threshold in the zero-subspace problem of Aron and Rueda for complex homogeneous polynomials. More precisely, for every $d$ and $k$ we determine the least $m$ such that every $d$-homogeneous polynomial on $\mathbb{C}^m$ vanishes on a $k$-dimensional linear subspace. We also determine the exact threshold for arbitrary polynomials of degree at most $d$ to be constant on a $k$-dimensional linear subspace. The two thresholds are different. In the homogeneous case the exact threshold follows from Tevelev's theorem on isotropic subspaces and closedness of the incidence locus. In the bounded-degree case we first eliminate the linear homogeneous component by passing to its kernel; the remaining components, of degrees $2,\ldots,d$, form the system to which the Debarre--Manivel theorem is applied. For $k=2$ we give a separate proof using top Chern classes and Newton's inequalities.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Nacib Albuquerque, Daniel M. Pellegrino, Anselmo Raposo Jr. 2026-08-25. The Aron--Rueda zero-subspace problem. https://arxiv.org/abs/2608.24504
Cite the original work for its findings. Save a collection to share your selection of sources.