Computing the non-properness set of real polynomial maps in the plane
From MaRDI portal
Publication:6672004
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Affine fibrations (14R25) Semialgebraic sets and related spaces (14P10) Real polynomials: analytic properties, etc. (26C05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Recommendations
- Properness of polynomial maps with Newton polyhedra
- Quantitative properties of the non-properness set of a polynomial map
- Note about the set \(S_f\) for a polynomial mapping \(f: {\mathbb{C}}^2\to {\mathbb{C}}^2\)
- Geometry of real polynomial mappings
- The set of points at which a polynomial map is not proper
Cites work
- scientific article; zbMATH DE number 17841 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- A condition for the properness of polynomial maps
- Algebraic Statistics for Computational Biology
- Algorithms in real algebraic geometry
- An effective description of the Jelonek set
- And yet it moves: paradoxically moving linkages in kinematics
- Asymptotic values of polynomial mappings of the real plane
- Biochemical reaction networks: An invitation for algebraic geometers
- Bounds for polynomials on algebraic numbers and application to curve topology
- Computational geometry. Algorithms and applications.
- Detecting Asymptotic Non-regular Values by Polar Curves
- Effective computational geometry for curves and surfaces
- Geometry of real polynomial mappings
- Geometry of the Jelonek set
- Injectivity of real polynomial maps and Łojasiewicz exponents at infinity
- Invertible polynomial mappings via Newton non-degeneracy
- Newton polytopes and irreducible components of complete intersections
- Note about the set \(S_f\) for a polynomial mapping \(f: {\mathbb{C}}^2\to {\mathbb{C}}^2\)
- On asymptotic critical values of a complex polynomial
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the bifurcation set of a polynomial function and Newton boundary
- On the bifurcation set of a polynomial function and Newton boundary. II
- On the geometry and the topology of parametric curves
- Polyedres de Newton et nombres de Milnor
- Polynomial images of \(\mathbb{R}^n\)
- Quantitative properties of the non-properness set of a polynomial map
- Real Jacobian mates
- Separation bounds for polynomial systems
- Solving bivariate systems using rational univariate representations
- Solving zero-dimensional systems through the rational univariate representation
- Sylvester-Habicht sequences and fast Cauchy index computation
- Testing sets for properness of polynomial mappings
- The discriminant of a system of equations
- The set of fixed points of a unipotent group
- The set of points at which a polynomial map is not proper
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Univariate real root isolation in an extension field and applications
- Univariate real root isolation in multiple extension fields
- Using Algebraic Geometry
This page was built for publication: Computing the non-properness set of real polynomial maps in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6672004)
