Skip to main content
Log in

Substitution and atomic extension on greedy posets

  • Published:
Order Aims and scope Submit manuscript

Abstract

In this paper, we study the operations of substitution and atomic extension on greedy posets. For the substitution operation, if P=(P 1 , x, P 2 )is a greedy poset, then P 1 and P 2 are greedy posets, the converse being false. However, for the atomic extension, P=P 1 (x, P 2 )is a greedy poset if and only if P 1 and P 2 are greedy posets. We prove also that the class of greedy semi-partitive lattices is the smallest one containing M n (n≥2), B 3 and closed by atomic extension. The class C n of greedy posets with jump number n is infinite. However, we show that C n can be obtained, in a very simple way, from a subclass D n of finite cardinal ity. We construct D n for n=1, 2.

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

References

  1. A. Batbedat (1983) Extensions atomiques d'ensembles ordonnés. Dep. de mathématiques, Univ. de Montpellier, preprint.

  2. O. Cogis and M. Habib (1979) Nombre de sauts et graphes series-paralleles, RAIRO Informatique théorique 13, 3–18.

    Google Scholar 

  3. R. P. Dilworth (1951) A decomposition theory for partially ordered sets, Ann. Math. 0, 161–166.

  4. M. H. El-Zahar and J. H. Schmerl (1984) On the size of setup critical ordered sets, Order 1, 3–6.

    Google Scholar 

  5. G. Gierz and W. Poguntke (1983) Minimizing setups for ordered sets: a linear algebraic approach, SIAM J. Alg. Disc. Methods 4, 133–144.

    Google Scholar 

  6. M. Habib (1981) Substitution des structures combinatoires. Théorie et algorithmes, Thése Sciences Math. Université Pierre et Marie Curie.

  7. M. Habib and R. Jegou (1985) N-free posets as generalizations of series-parallel posets, Disc. Appl. Math. 12, 279–291.

    Google Scholar 

  8. R. H. Mohring and F. J. Radermacher (1984) Substitution decomposition for discrete structures and connection with combinatorial optimization, preprint.

  9. I. Rival (1983) Optimal linear extensions by interchanging chains, Proc. Amer. Math. Soc. 89, 387–394.

    Google Scholar 

  10. G. Steiner (1985) On finding the jump number of a partial order by substitution decomposition, Order 2, 9–24.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by I. Rival

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elbaz, J. Substitution and atomic extension on greedy posets. Order 3, 235–244 (1986). https://doi.org/10.1007/BF00400287

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00400287

AMS (MOS) subject classifications (1980)

Key words

Navigation