A Poset Hierarchy

Džamonja, Mirna and Thompson, Katherine (2006) A Poset Hierarchy. Central European Journal of Mathematics, 4 (2). pp. 225-241. ISSN 1644-3616

Full text not available from this repository. (Request a copy)

Abstract

This article extends a paper of Abraham and Bonnet which generalised the famous Hausdorff characterisation of the class of scattered linear orders. They gave an inductively defined hierarchy that characterised the class of scattered posets which do not have infinite incomparability antichains (i.e. have the FAC). We define a larger inductive hierarchy ?H* which characterises the closure of the class of all ?-well-founded linear orders under inversions, lexicographic sums and FAC weakenings. This includes a broader class of “scattered” posets that we call ?-scattered. These posets cannot embed any order such that for every two subsets of size < ?, one being strictly less than the other, there is an element in between. If a linear order has this property and has size ? it is unique and called Q(?). Partial orders such that for every a < b the set {x: a < x < b} has size = ? are called weakly ?-dense, and posets that do not have a weakly ?-dense subset are called strongly ?-scattered. We prove that ?H* includes all strongly ?-scattered FAC posets and is included in the class of all FAC ?-scattered posets. For ? = ?0 the notions of scattered and strongly scattered coincide and our hierarchy is exactly aug(H) from the Abraham-Bonnet theorem.

Item Type: Article
Faculty \ School: Faculty of Science > School of Mathematics
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 18 Mar 2011 10:19
Last Modified: 24 Jul 2019 15:53
URI: https://ueaeprints.uea.ac.uk/id/eprint/19956
DOI: 10.1007/s11533-006-0001-1

Actions (login required)

View Item View Item