Lexicographic Sums

Bernd S. W. Schröder
Additional contact information
Bernd S. W. Schröder: Lousiana Tech University, Program of Mathematics and Statistics

Chapter 9 in Ordered Sets, 2003, pp 201-225 from Springer

Abstract: Abstract So far, we have introduced basic concepts of ordered sets and several important classes of ordered sets. In this chapter we will ask ourselves for the first time how we can use existing ordered sets to build new ordered sets. The construction we exhibit here, lexicographic sums, comes from a very simple pictorial idea. Take an ordered set T and replace each of its points t with an ordered set P t . The resulting structure will be a new, larger ordered set. Natural questions to ask are of course how various order-theoretical properties and parameters behave under lexicographic constructions.

Keywords: Convex Subset; Complete Lattice; Comparability Graph; Point Property; Interval Order (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-0053-6_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461200536

DOI: 10.1007/978-1-4612-0053-6_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().