Counting real zeros in the multivariate case
This paper provides a computational base of effective counting the number of a real algebraic set of dimension zero in an algebraic constraint region, generalizing Hermite's theorem to the case of several variables. In the main theorem (theorem 2.1), the number is described by the signature of a bilinear form defined on the structure ring of the algebraic set. A complete proof is given. -- It would be useful to notice that the result is closely related to papers of \textit{D. Eisenbud} and \textit{H. I. Levine} [Ann. Math., II. Ser. 106, 19-44 (1977; Zbl 0398.57020)], \textit{K. Aoki}, \textit{T. Fukuda} and \textit{T. Nishimura} [Topology and computer sciences, Proc. Symp. Atami 1986, 347-363 (1987)], and \textit{J. Montaldi} and \textit{D. van Straten} [Topology 29, No. 4, 501- 510 (1990; Zbl 0755.32032)]. Remarking that the bilinear form is calculated using the Gröbner basis, the authors proceed to study the computational complexity of the algorithm of counting real zeros, based on the main theorem. They also mention the calculation of the Euler characteristic of smooth real hypersurfaces. This paper seems to be readable widely both for pure mathematicians and for specialists of computation. It is therefore a pity that there are several misprints, especially, about the references. For the entire collection see [Zbl 0917.00011].
- On the number of real zeros of random fewnomials
- Counting Zeros of Real Polynomials within the Unit Disk
- Counting Zeros of Random Functions
- The estimation of the zeros of some counting polynomials
- Real zeros of mixed random fewnomial systems
- scientific article; zbMATH DE number 4058571
- scientific article; zbMATH DE number 2187769
- Covariance of the number of real zeros of a random algebraic polynomial
- Count of many zeros of a class of random algebraic polynomials
- Counting Zeros Using Observability and Block Toeplitz Matrices
- Milne's volume function and vector symmetric polynomials
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- NC algorithms for real algebraic numbers
- Product formulas for resultants and Chow forms
- Dense resultant of composed polynomials: mixed-mixed case
- Radical computations of zero-dimensional ideals and real root counting.
- On solving univariate sparse polynomials in logarithmic time
- Simultaneous elimination by using several tools from real algebraic geometry
- An algorithm for isolating the real solutions of semi-algebraic systems
- Bounds of traces in complete intersections and degrees in the Nullstellensatz
- Multivariate polynomials, duality, and structured matrices
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Separation bounds for polynomial systems
- Intrinsic complexity estimates in polynomial optimization
- Localization of real algebraic hypersurfaces with applications to the enumeration of the classes of relative equilibria of a \((5+1)\)-body problem
- On multivariate Hermitian quadratic forms
- On the real rank of monomials
- Degree formulas and signature formulas for the Euler characteristic of real algebraic sets
- Real solution isolation using interval arithmetic
- Certified Hermite matrices from approximate roots
- On the implementation of CGS real QE
- Counting signed swallowtails of polynomial selfmaps of R^3
- On the span of polynomials with integer coefficients
- scientific article; zbMATH DE number 16663 (Why is no real title available?)
- scientific article; zbMATH DE number 1138324 (Why is no real title available?)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- Counting Zeros Using Observability and Block Toeplitz Matrices
- Stickelberger and the Eigenvalue Theorem
- Rational points and trace forms on a finite algebra over a real closed field
- On deformations of hyperbolic varieties
- Real fibered morphisms and Ulrich sheaves
- CGSQE/SyNRAC: a real quantifier elimination package based on the computation of comprehensive Gröbner systems
- Fundamental class of real algebraic sets
- The first rational Chebyshev knots
- Condition number based complexity estimate for solving polynomial systems
- On the computation of matrices of traces and radicals of ideals
- Intersection number of a map with the set of matrices of positive corank
- Faster one block quantifier elimination for regular polynomial systems of equations
- A geometric approach to cylindrical algebraic decomposition
- A local theory of real multiplicity
- On polynomial mappings from the plane to the plane
- Geometry and topology of proper polynomial mappings
- Blind algebraic identification of communication channels: symbolic solution algorithms
This page was built for publication: Counting real zeros in the multivariate case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3135183)