From enumerative geometry to solving systems of polynomial equations
enumerative geometryMacaulay2systems of polynomial equationstangent to 4 spherestangent to real quadrics
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Numerical computation of solutions to systems of equations (65H10) Symbolic computation and algebraic computation (68W30)
Often there is an interest in solutions of polynomial systems of equations. Enumerative geometry is concerned with the counting of the number of solutions for those systems arising in geometric situations. The intersection theory provides methods to accomplish the enumeration. The author investigates some problems from enumerative geometry, illustrating some applications of symbolic computation to this important part of solving polynomial equations. The considered enumerative problems include those which are overdetermined respectively improper. There are also considerations of real solutions of these geometric properties. A particular investigation is devoted to the study of lines tangent to 4 spheres respectively lines tangent to real quadrics sharing a real conic in three space respectively in higher dimensions. For the entire collection see [Zbl 0973.00017].
- Counting solutions of polynomial systems via iterated fibrations
- A convex geometric approach to counting the roots of a polynomial system
- Constructing polynomial systems with many positive solutions using tropical geometry
- On the geometry and topology of the solution variety for polynomial system solving
- Volume-preserving mappings between Hermitian symmetric spaces of compact type
- Rational curves on Grassmannians: systems theory, reality, and transversality
- The computing of Chern classes of symmetric power of vector lattices of rank 2. An application to enumerative geometry.
- Enumerative geometry versus counting problems of low degree polynomial vector fields
- Enumerative algebraic geometry of conics
- On the complexity of the generalized MinRank problem
- Mathematical tools for loop transformations: From systems of uniform recurrence equations to the polytope model
- ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
- Stickelberger and the Eigenvalue Theorem
- 3264 conics in a second
- A global approach for solving edge-matching puzzles
- Real solutions to systems of polynomial equations in Macaulay2
This page was built for publication: From enumerative geometry to solving systems of polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763707)
