Generic polynomials of fixed degree d at least 2 on product spaces are non-Cartesian, with algorithmic decidability via Groebner bases and applications yielding sharp incidence bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the structure and generic non-Cartesianity of polynomials in product spaces
Generic polynomials of fixed degree d at least 2 on product spaces are non-Cartesian, with algorithmic decidability via Groebner bases and applications yielding sharp incidence bounds.