Jesse Elliott
ABSTRACT
We present a full analysis of the bit complexity of an efficient algorithm for the computation of at least one point in each connected component of a smooth real hypersurface. This is a basic and important operation in semi-algebraic geometry: it gives an upper bound on the number of connected components of a real hypersurface, and is also used in many higher level algorithms.
Our starting point is an algorithm by Safey El Din and Schost (Polar varieties and computation of one point in each connected component of a smooth real algebraic set, ISSAC'03). This algorithm uses random changes of variables that are proved to generically ensure certain desirable geometric properties. The cost of the algorithm was given in an algebraic complexity model; the analysis of the bit complexity and the error probability were left for future work.
Our paper answers these questions. Our main contribution is a quantitative analysis of several genericity statements, such as Thom's weak transversality theorem or Noether normalization properties for polar varieties.
- M. Alonso, E. Becker, M.-F. Roy, and T. Wörmann. 1996. Zeroes, multiplicities and idempotents for zerodimensional systems. In Algorithms in algebraic geometry and applications. Proceedings of MEGA'94 (Progress in Mathematics), Vol. 142. Birkhaüser, 1--15.Google Scholar
- B. Bank, M. Giusti, and J. Heintz. 2014. Point searching in real singular complete intersection varieties: Algorithms of intrinsic complexity. Math. Comp. 83 (2014), 873--897.Google ScholarCross Ref
- B. Bank, M. Giusti, J. Heintz, L. Lehmann, and L.-M. Pardo. 2012. Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces. Foundations of Computational Mathematics 12 (2012), 75--122.Google ScholarDigital Library
- B. Bank, M. Giusti, J. Heintz, and G. Mbakop. 1997. Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case. Journal of Complexity 13, 1 (1997), 5--27.Google ScholarDigital Library
- B. Bank, M. Giusti, J. Heintz, and G.-M. Mbakop. 2001. Polar varieties and efficient real elimination. Mathematische Zeitschrift 238, 1 (2001), 115--144.Google ScholarCross Ref
- B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. 2005. Generalized polar varieties: geometry and algorithms. Journal of Complexity 21, 4 (2005), 377--412.Google ScholarDigital Library
- S. Basu, R. Pollack, and M.-F. Roy. 2003. Algorithms in Real Algebraic Geometry. Algorithms and computation in mathematics, Vol. 10. Springer-Verlag.Google ScholarDigital Library
- W. Baur and V. Strassen. 1983. The complexity of partial derivatives. Theoret. Comput. Sci. 22, 3 (1983), 317--330.Google ScholarCross Ref
- J. Bochnak, M. Coste, and M.-F. Roy. 1998. Real algebraic geometry. Springer-Verlag.Google Scholar
- C. D'Andrea, T. Krick, and M. Sombra. 2013. Heights of varieties in muliprojective spaces and arithmetic Nullstellensatz. Annales scientifiques de l'École Normale Supérieure 46, 4 (Aug 2013), 549--627.Google Scholar
- M. Demazure. 2000. Bifurcations and catastrophes: geometry of solutions to nonlinear problems. Springer.Google ScholarCross Ref
- D. Eisenbud. 1995. Commutative Algebra with a View Toward Algebraic Geometry (1st. ed.). Graduate Texts in Mathematics, Vol. 150. Springer-Verlag, New York.Google Scholar
- P. Gianni and T. Mora. 1989. Algebraic solution of systems of polynomial equations using Groebner bases. In AAECC (LNCS), Vol. 356. Springer, 247--257.Google Scholar
- M. Giusti, K. Hägele, J. Heintz, J.-E. Morais, J.-L. Montaña, and L.-M. Pardo. 1997. Lower bounds for diophantine approximation. J. of Pure and Applied Algebra 117/118 (1997), 277--317.Google Scholar
- M. Giusti, J. Heintz, J.-E. Morais, J. Morgenstern, and L.-M. Pardo. 1998. Straightline programs in geometric elimination theory. Journal of Pure and Applied Algebra 124 (1998), 101--146.Google ScholarCross Ref
- M. Giusti, J. Heintz, J.-E. Morais, and L.-M. Pardo. 1995. When polynomial equation systems can be solved fast?. In AAECC-11 (LNCS), Vol. 948. Springer, 205--231.Google Scholar
- M. Giusti, J. Heintz, and J. Sabia. 1993. On the efficiency of effective Nullstellensätze. Computational Complexity 3 (1993), 56--95.Google ScholarDigital Library
- D. Grigoriev and N. Vorobjov. 1988. Solving Systems of Polynomial Inequalities in Subexponential Time. J. Symbolic Comput. 5 (1988), 37--64.Google ScholarDigital Library
- J. Heintz. 1983. Definability and fast quantifier elimination in algebraically closed fields. Theoretical Computer Science 24, 3 (May 1983), 239--277.Google ScholarCross Ref
- G. Jeronimo and J. Sabia. 2002. Effective equidimensional decomposition of affine varieties. Journal of Pure and Applied Algebra 169 (2002), 229--248.Google ScholarCross Ref
- T. Krick, L.-M. Pardo, and M. Sombra. 2001. Sharp estimates for the arithmetic Nullstellensatz. Duke Mathematical Journal 109, 3 (2001), 521--598.Google ScholarCross Ref
- L. Kronecker. 1882. Grundzüge einer arithmetischen Theorie der algebraischen Grössen. Journal für die reine und angewandte Mathematik 92 (1882), 1--122.Google Scholar
- F. Macaulay. 1916. The Algebraic Theory of Modular Systems. Cambridge University Press.Google Scholar
- D. Mumford. 1976. Algebraic Geometry 1 : complex algebraic varieties. Springer.Google Scholar
- R. Piene. 1978. Polar classes of singular varieties. Annales Scientifiques de l'École Normale Supérieure 11, 2 (1978), 247--276.Google Scholar
- F. Rouillier. 1999. Solving zero-dimensional systems through the Rational Univariate Representation. Applicable Algebra in Engineering, Communication and Computing 9, 5 (1999), 433--461.Google ScholarCross Ref
- É. Schost. 2003. Computing Parametric Geometric Resolutions. Applicable Algebra in Engineering, Communication and Computing 5 (2003), 349--393.Google Scholar
- É. Schost and M. Safey El Din. 2003. Polar Varieties and Computation of one Point in each Connected Component of a Smooth Real Algebraic Set. In ISSAC'03. ACM, 224--231.Google Scholar
- É. Schost and M. Safey El Din. 2011. A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface. Discrete and Computational Geometry 5 (2011), 181--220.Google ScholarCross Ref
- É. Schost and M. Safey El Din. 2017. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. J. ACM 63, 6 (Feb. 2017), 1--48.Google Scholar
- É. Schost and M. Safey El Din. 2018. Bit complexity for multi-homogeneous system solving. Application to polynomial minimization. Journal of Symbolic Computation 87 (May 2018), 176--206.Google ScholarCross Ref
- É. Schost, B. Saugata, M-F Roy, and M. Safey El Din. 2014. A baby step-giant step roadmap algorithm for general algebraic sets,. Foundations of Computational Mathematics 14 (2014), 1117--1172.Google ScholarDigital Library
- I. Shafarevich. 1977. Basic Algebraic Geometry 1. Springer Verlag.Google Scholar
- B. Teissier. 1988. Quelques points de l'histoire des variétés polaires, de Poncelet à nos jours. In Sém. Annales Univ. Blaise Pascal, Vol. 4.Google Scholar
Index Terms
- On the bit complexity of finding points in connected components of a smooth real hypersurface
Recommendations
Bit complexity for computing one point in each connected component of a smooth real algebraic set
AbstractWe analyze the bit complexity of an algorithm for the computation of at least one point in each connected component of a smooth real algebraic set. This work is a continuation of our analysis of the hypersurface case (On the bit ...
On the Complexity of Computing Real Radicals of Polynomial Systems
ISSAC '18: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic ComputationLet f= (f1, ..., fs) be a sequence of polynomials in Q[X1,...,Xn] of maximal degree D and V⊂ Cn be the algebraic set defined by f and r be its dimension. The real radical re < f > associated to f is the largest ideal which defines the real trace of V . ...
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good performance ...
Comments