Counting solutions of polynomial systems via iterated fibrations

DOI10.1007/S00013-008-2785-7MaRDI QIDQ1016493zbMATH OpenOpenAlexFDO

Authors Wilhelm Plesken

Publication date 6 May 2009

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00013-008-2785-7

zbMATH Keywords

counting polynomialpolynomial equationspolynomial inequationssimple systemssolutions of polynomial systemsThomas algorithmtriangular decomposition

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13P99) Fibrations, degenerations in algebraic geometry (14D06) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Computational aspects in algebraic geometry (14Q99)

Review text

The counting polynomial for a system of polynomial equations and inequalities in affine or projective space is defined via a decomposition of the solution set into subsets that can be defined by triangular-like systems, in the sense of \textit{J. M. Thomas} [Differential systems. AMS Coll. Publ. 21 (1937; JFM 63.0438.03)]. Its properties are similar to those of the Hilbert polynomial: its degree is the dimension of the solution set, and if the number of solution is finite, then the polynomial is the number of solutions.

Recommendations

• Counting solutions to polynomial systems via reductions
• On the number of solutions of polynomial systems
• Counting positive solutions for polynomial systems with real coefficients
• Counting solutions to some polynomial equations over finite fields
• How many zeroes? Counting solutions of systems of polynomials via toric geometry at infinity
• On the solutions to polynomial systems obtained by homotopy methods
• scientific article; zbMATH DE number 1693051
• Counting affine roots of polynomial systems via pointed Newton polytopes
• On decomposing systems of polynomial equations with finitely many solutions
• Number of solutions of systems of homogeneous polynomial equations over finite fields

Cited in

(11)

• Defining the \(q\)-analogue of a matroid
• The differential counting polynomial
• Algebraically simple involutive differential systems and the Cauchy problem
• S-iteration scheme and polynomiography
• Algorithmic Thomas decomposition of algebraic and differential systems
• Truncation of systems of polynomial equations, ideals and varieties
• An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
• Thomas decomposition and nonlinear control systems
• An L₂-quotient algorithm for finitely presented groups.
• Singularities of algebraic differential equations
• Counting solutions to binomial complete intersections

This page was built for publication: Counting solutions of polynomial systems via iterated fibrations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016493)