Skip to main navigation Skip to search Skip to main content

Embedding structures

  • Marcel Erné*
  • , Jürgen Reinhold
  • *Corresponding author for this work

Research output: Contribution to journalArticleResearchpeer review

Abstract

For any quasiordered set ('quoset') or topological space S, the set Sub S of all nonempty subquosets or subspaces is quasiordered by embeddability. Given any cardinal number n, denote by pn and qn the smallest size of spaces S such that each poset, respectively, quoset with n points is embeddable in Sub S. For finite n, we prove the inequalities n + 1 ≤ pn ≤ qn ≤ pn + l(n) + l(l(n)), where l(n) = min{k ⊂ ℕ | n ≤ 2k}. For the smallest size bn of spaces S so that Sub S contains a principal filter isomorphic to the power set script P sign(n), we show n + l(n) - 1 ≤ bn ≤ n + l(n) + l(l(n)) + 2. Since pn ≤ bn, we thus improve recent results of McCluskey and McMaster who obtained pn ≤ n2. For infinite n, we obtain the equation bn = pn = qn = n.

Original languageEnglish
Pages (from-to)637-645
Number of pages9
JournalGraphs and combinatorics
Volume17
Issue number4
DOIs
Publication statusPublished - Dec 2001

Keywords

  • Boolean
  • Embedding
  • Poset
  • Quasiordered set
  • Representation
  • Space
  • Subspace

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this