On the geometry of polar varieties

From MaRDI portal
Publication:2267371

DOI10.1007/s00200-009-0117-1zbMath1186.14060arXiv0910.1476OpenAlexW2164838307MaRDI QIDQ2267371

Mohab Safey El Din, Bernd Bank, Joos Heintz, Éric Schost, Marc Giusti

Publication date: 1 March 2010

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.1476



Related Items

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients, On the complexity of the generalized MinRank problem, Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics, Permutations encoding the local shape of level curves of real polynomials via generic projections, VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities, Refined F5 Algorithms for Ideals of Minors of Square Matrices, Refined bounds on the number of connected components of sign conditions on a variety, Global optimization of polynomials restricted to a smooth variety using sums of squares, Variant quantifier elimination, Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Numerically computing real points on algebraic sets, Polar degrees and closest points in codimension two, Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field, Solving determinantal systems using homotopy techniques, Homotopy techniques for solving sparse column support determinantal polynomial systems, Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications, Intrinsic complexity estimates in polynomial optimization, On exact Reznick, Hilbert-Artin and Putinar's representations, On types of degenerate critical points of real polynomial functions, Verified error bounds for singular solutions of nonlinear systems, Exact Algorithms for Linear Matrix Inequalities, Degeneracy loci and polynomial equation solving, Bit complexity for computing one point in each connected component of a smooth real algebraic set, Smooth points on semi-algebraic sets, Computing critical points for invariant algebraic systems, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity


Uses Software


Cites Work