The following theorems answer \textit{D. Daykin}'s problem 2.10 [see Graphs and Order. Proc. NATO Adv. Study Inst., Banff/Can. 1984, NATO ASI Ser., Ser. C 147, 522-590 (1985)]: A countable poset P can be imbedded into the chain Z of integers iff only finitely many elements lie between each pair of elements in P. Denote, for \(V\subseteq P\), \(\bar V=\{x\in V\); \(v\leq x\leq w\) for any v,w\(\in V\}\). If P can be imbedded into Z, then an imbedding f of a finite \(S\subseteq P\) into Z is extendable to an imbedding of P into Z iff every \(V\subseteq P\) satisfies \(card \bar V\leq card \overline{f(V)}.\)
- Strictly order-preserving maps into $\mathbb{Z}$. A problem of Daykin from the 1984 Banff conference on graphs and order.
- On chains and posets within the power set of a continuum
- Strictly order-preserving maps into Z. II: A 1979 problem of Erné
- Incomparable copies of a poset in the Boolean lattice.
- A note on the dimension of a poset
- Conditions for the discovery of solution horizons
- Algebraic structures on integer posets
- Poset embeddings of Hilbert functions
- scientific article; zbMATH DE number 605243 (Why is no real title available?)
- scientific article; zbMATH DE number 1154166 (Why is no real title available?)
- Strictly order-preserving maps into $\mathbb{Z}$. A problem of Daykin from the 1984 Banff conference on graphs and order.
- scientific article; zbMATH DE number 966834 (Why is no real title available?)
This page was built for publication: Imbedding posets in the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762507)
