IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-04166-6_61.html
   My bibliography  Save this book chapter

Extending a Partially Ordered Set: Links with its Lattice of Ideals

In: Formal Power Series and Algebraic Combinatorics

Author

Listed:
  • Philippe Baldy

    (Université Paris 7 Denis Diderot, LIAFA)

  • Michel Morvan

    (Université Paris 7 Denis Diderot, LIAFA)

  • Eric Thierry

    (161 rue Ada, LIRMM)

Abstract

A well-known result of Bonnet and Pouzet [3] bijectively links the set of linear extensions of a partial order P with the set of maximal chains of its lattice of ideals I(P). We extend this result by showing that there is a one-to-one correspondence between the set of all extensions of P and the set of all sublattices of I(P) which are chain-maximal in the sense that every chain which is maximal (for inclusion) in the sublattice is also maximal in the lattice. We prove that the absence of an order S as a convex suborder of P is equivalent to the absence of I(S) as a convex suborder of I(P). Let S be a set of partial orders and let us call S-convex-free any order that does not contain any order of S as convex suborder. We deduce from the previous results that there is a one-to-one correspondence between the set of S-convex-free extensions of P and the set of I(S)-convex-free chain-maximal sublattices of I(P). This can be applied to some classical classes of orders (total orders and in the finite case, weak orders, interval orders, N-free orders). In the particular case of total orders this gives as a corollary the result of Bonnet and Pouzet.

Suggested Citation

  • Philippe Baldy & Michel Morvan & Eric Thierry, 2000. "Extending a Partially Ordered Set: Links with its Lattice of Ideals," Springer Books, in: Daniel Krob & Alexander A. Mikhalev & Alexander V. Mikhalev (ed.), Formal Power Series and Algebraic Combinatorics, pages 625-632, Springer.
  • Handle: RePEc:spr:sprchp:978-3-662-04166-6_61
    DOI: 10.1007/978-3-662-04166-6_61
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-662-04166-6_61. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.