Reconstruction of N-free ordered sets
The deck of an ordered set is the collection of unlabelled one-point-deleted ordered subsets. Two decks are isomorphic if there is a bijection between the two decks such that each deck is isomorphic to its image. We say that a class of ordered sets \({\mathcal C}\) is reconstructible if for any two ordered sets \(P\) and \(Q\) with isomorphic decks either the sets are isomorphic or neither one is in \({\mathcal C}\). It is an open question if the class of ordered sets with at least 4 elements is reconstructible. An ordered set is N-free if it does not contain a quadruple of elements \(a\), \(b\), \(c\), \(d\) such that \(a\prec b\succ c\prec d\), where \(\prec\) stands for the covering relation in the ordered set. In the paper the author proves that the class of N-free ordered sets with at least 4 elements is reconstructible.
- Order types of free subsets
- What is reconstruction for ordered sets?
- More examples on ordered set reconstruction
- Examples on ordered set reconstruction
- scientific article; zbMATH DE number 5914899 (Why is no real title available?)
- scientific article; zbMATH DE number 540524 (Why is no real title available?)
- Ordered sets that are reconstructible from two cards and the number of comparabilities.
- New order relations in set optimization
- Reconstruction of the neighborhood deck of an ordered set
- scientific article; zbMATH DE number 7686209 (Why is no real title available?)
- Critically prime interval orders
This page was built for publication: Reconstruction of N-free ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5947338)
