Abstract.
Let P be a preorder (i.e., reflexive, transitive relation) on a finite set X. The ideal polynomial of P is the function \({\text{ideal}}_{P} (x) = {\sum\nolimits_{k \geqslant 0} {d_{k} x^{k} ,} }\) where d k is the number of ideals (i.e. downwards closed sets) of cardinality k in P. We provide upper bounds for the moduli of the roots of ideal P (x) in terms of the width of P. We also provide examples of preorders with roots of large moduli. The results have direct applications to the generating polynomials counting open sets in finite topologies.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received December 15, 2004
Rights and permissions
About this article
Cite this article
Brown, J.I., Hickman, C.A., Thomas, H. et al. Bounding the Roots of Ideal and Open Set Polynomials. Ann. Comb. 9, 259–268 (2005). https://doi.org/10.1007/s00026-005-0255-5
Issue Date:
DOI: https://doi.org/10.1007/s00026-005-0255-5