Skip to main content
Log in

Bounding the Roots of Ideal and Open Set Polynomials

  • Original Paper
  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jason I. Brown.

Additional information

Received December 15, 2004

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-005-0255-5

AMS Subject Classification.

Keywords.

Navigation