Lexicographic Sums

Bernd Schröder
Additional contact information
Bernd Schröder: University of Southern Mississippi, Department of Mathematics

Chapter Chapter 7 in Ordered Sets, 2016, pp 173-197 from Springer

Abstract: Abstract In this chapter, we investigate a construction, lexicographic sums, that uses existing ordered sets to build new ordered sets. The pictorial idea is very simple: 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. It is then natural to ask how various order-theoretical properties and parameters behave under lexicographic constructions. We will revisit lexicographic sums in later chapters to specifically answer this question in a variety of contexts. At the end of this chapter, in Section 7.6, we will explain the definition of “hard” problems that was mentioned at the start of Section 5.4 (see Definition 7.30). We will then use a construction that is close to the lexicographic sum construction (see Section 7.5), to show that determining if an ordered set has the fixed point property is “hard.”

Keywords: Comparability Graph; Point Property; Canonical Decomposition; Covering Graph; Fixed Point Property (search for similar items in EconPapers)
Date: 2016
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-3-319-29788-0_7

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

DOI: 10.1007/978-3-319-29788-0_7

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 ().