Generalized dimension of an ordered set and its MacNeille completion (Q1338129)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 695770
Language Label Description Also known as
default for all languages
No label defined
    English
    Generalized dimension of an ordered set and its MacNeille completion
    scientific article; zbMATH DE number 695770

      Statements

      Generalized dimension of an ordered set and its MacNeille completion (English)
      0 references
      0 references
      0 references
      0 references
      29 March 1995
      0 references
      For an ordered set \(P\) and a class \(C\) of orders on \(P\) containing all chains, the authors define a \(C\)-dimension of \(P\) (\(C\)-dim \(P\)) as the least number of \(C\)-extensions such that their intersection realizes the given order on \(P\). The MacNeille completion \(L(P)\) of an ordered set is the smallest lattice into which the ordered set can be embedded such that the order is preserved. It is well known that \(C\text{-dim }P = C \text{-dim }L(P)\), where \(C\) is the class of all linear extensions. Main results: 1. Let \(C\) be a class of ordered sets which is closed under suborder relation, under MacNeille completion and under substitutions by chains. Then for every ordered set \(P\), \(C\text{dim } P = C-\text{-dim }L(P)\). 2. Let \(S \subseteq \{2 \oplus 1, 2 \oplus 2\} \cup \{Q : Q \text{ does not contain an autonomous chain}\}\). If \(C_ S\) is closed under MacNeille completion, then for every ordered set \(P\), \(C_ S\text{-dim } P = C_ S \text{-dim } L(P)\). Finally, the authors give an example of a class which is closed under MacNeille completion but is not under substitution by chains.
      0 references
      generalized order dimension
      0 references
      MacNeille completion
      0 references
      substitution by chains
      0 references

      Identifiers