Counting solutions of polynomial systems via iterated fibrations

DOI10.1007/s00013-008-2785-7zbMath1180.14053OpenAlexW1992297814MaRDI QIDQ1016493

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

polynomial equationsThomas algorithmtriangular decompositionsimple systemscounting polynomialpolynomial inequationssolutions of polynomial systems

Mathematics Subject Classification ID

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

Related Items (8)

Singularities of algebraic differential equations ⋮ Defining the \(q\)-analogue of a matroid ⋮ Algorithmic Thomas decomposition of algebraic and differential systems ⋮ Thomas Decomposition and Nonlinear Control Systems ⋮ Algebraically simple involutive differential systems and the Cauchy problem ⋮ The differential counting polynomial ⋮ An \(L_2\)-quotient algorithm for finitely presented groups. ⋮ An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties

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