Properness defects of projection and minimal discriminant variety

DOI10.1016/j.jsc.2011.05.013zbMath1235.13026OpenAlexW2071272143MaRDI QIDQ719760

Guillaume Moroz

Publication date: 11 October 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.05.013

zbMATH Keywords

eliminationparametric polynomial systemdiscriminant varietydeterministic complexity

Mathematics Subject Classification ID

Projective techniques in algebraic geometry (14N05) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items (2)

Invariant algebraic sets and symmetrization of polynomial systems ⋮ Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image

Uses Software

• Kronecker
• RAGlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
• Definability and fast quantifier elimination in algebraically closed fields
• On the complexity of computing syzygies
• A new method for solving algebraic systems of positive dimension
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
• Lower bounds for diophantine approximations
• Straight-line programs in geometric elimination theory
• Computing triangular systems and regular systems
• A pure power product version of the Hilbert Nullstellensatz
• Triangular sets for solving polynomial systems: a comparative implementation of four methods
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Complexity results for triangular sets
• Solving parametric polynomial systems
• Testing sign conditions on a multivariate polynomial and applications
• Associative differential operations
• On the Theoretical and Practical Complexity of the Existential Theory of Reals
• Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants
• Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
• The Space Complexity of Elimination Theory: Upper Bounds
• Le rôle des structures de données dans les problèmes d'élimination
• Sum of roots with positive real parts
• On using bi-equational constraints in CAD construction
• Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities
• Automated Deduction in Geometry
• Algorithms in real algebraic geometry
• A Gröbner free alternative for polynomial system solving

This page was built for publication: Properness defects of projection and minimal discriminant variety