Counting solutions of polynomial systems via iterated fibrations (Q1016493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting solutions of polynomial systems via iterated fibrations |
scientific article; zbMATH DE number 5551219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting solutions of polynomial systems via iterated fibrations |
scientific article; zbMATH DE number 5551219 |
Statements
Counting solutions of polynomial systems via iterated fibrations (English)
0 references
6 May 2009
0 references
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.
0 references
polynomial equations
0 references
polynomial inequations
0 references
solutions of polynomial systems
0 references
Thomas algorithm
0 references
counting polynomial
0 references
simple systems
0 references
triangular decomposition
0 references
0.9187606
0 references
0.9175321
0 references
0.89837897
0 references
0.89316523
0 references
0.8896802
0 references
0.8852372
0 references
0.87947416
0 references
0.8790448
0 references
