Skip to main content
Log in

Fixed Point Property for Finite Ordered Sets that Contain No Crowns with 6 or More Elements

  • Published:
Order Aims and scope Submit manuscript

Abstract

We prove that, for a finite ordered set P that contains no crowns with 6 or more elements, it can be determined in polynomial time if P has the fixed point property. This result is obtained by proving that every such ordered set must contain a point of rank 1 that has a unique lower cover or a retractable minimal element.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Donalies, M., Schröder, B.: Performance guarantees and applications for Xia’s algorithm. Discret. Math. 213, 67–86 (2000) (Proceedings of the Banach Center Minisemester on Discrete Mathematics, week on Ordered Sets)

    Article  MathSciNet  Google Scholar 

  2. Duffus, D., Goddard, T.: The complexity of the fixed point property. Order 13, 209–218 (1996)

    Article  MathSciNet  Google Scholar 

  3. Felsner, S.: 3-interval irreducible partially ordered sets. Order 11, 97–125 (1994)

    Article  MathSciNet  Google Scholar 

  4. Fofanova, T., Rutkowski, A.: The fixed point property in ordered sets of width two. Order 4, 101–106 (1987)

    Article  MathSciNet  Google Scholar 

  5. Fofanova, T., Rival, I., Rutkowski, A.: Dimension 2, fixed points and dismantlable ordered sets. Order 13, 245–253 (1994)

    MathSciNet  MATH  Google Scholar 

  6. Niederle, J.: Forbidden retracts for finite ordered sets of width at most four. Discrete Math. 308, 1774–1784 (2008)

    Article  MathSciNet  Google Scholar 

  7. Rival, I.: A fixed point theorem for finite partially ordered sets. J. Comb. Theory (A) 21, 309–318 (1976)

    Article  MathSciNet  Google Scholar 

  8. Schröder, B.: Fixed point property for 11-element sets. Order 10, 329–347 (1993)

    Article  MathSciNet  Google Scholar 

  9. Schröder, B.: Ordered Sets—an Introduction with Connections from Combinatorics to Topology, 2nd edn. Boston, Birkhäuser Verlag (2016)

    MATH  Google Scholar 

  10. Schröder, B.: The fixed point property for ordered sets of interval dimension 2. Order 34, 307–322 (2016)

    Article  MathSciNet  Google Scholar 

  11. Trotter, W. T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins University Press, Baltimore (1992)

    MATH  Google Scholar 

  12. Zaguia, I.: On the fixed point property for (3 + 1)-free ordered sets. Order 28, 465–479 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author thanks the referees for constructive suggestions that improved and streamlined the presentation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bernd S. W. Schröder.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Schröder, B.S.W. Fixed Point Property for Finite Ordered Sets that Contain No Crowns with 6 or More Elements. Order 37, 173–178 (2020). https://doi.org/10.1007/s11083-019-09498-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-019-09498-z

Keywords