Abstract.
The paper introduces a new polynomial to count the solutions of a system of polynomial equations and inequations over an algebraically closed field of characteristic zero based on the triangular decomposition algorithm by J. M. Thomas of the nineteen-thirties. In the special case of projective varieties examples indicate that it is a finer invariant than the Hilbert polynomial.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 8 March 2008; Revised: 12 August 2008
Rights and permissions
About this article
Cite this article
Plesken, W. Counting solutions of polynomial systems via iterated fibrations. Arch. Math. 92, 44–56 (2009). https://doi.org/10.1007/s00013-008-2785-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00013-008-2785-7