Computing Complex Dimension Faster and Deterministically
Algebraic Geometry
2025-10-20 v1 Numerical Analysis
Numerical Analysis
Abstract
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper quantitative estimates on rational univariate representations of roots of polynomial systems. As a corollary of the latter bounds, we considerably improve a recent algorithm of Koiran for deciding the emptiness of a hypersurface intersection over the complex numbers, given the truth of the Generalized Riemann Hypothesis (GRH).
Cite
@article{arxiv.math/0005028,
title = {Computing Complex Dimension Faster and Deterministically},
author = {J. Maurice Rojas},
journal= {arXiv preprint arXiv:math/0005028},
year = {2025}
}
Comments
A mild revision of an earlier version submitted to a conference proceedings. Latex file needs acmconf.cls to compile