Partitions of a Finite Partially Ordered Set
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some surjection having the poset as domain. We then obtain combinatorial characterisations of such notions in terms of blocks, without reference to surjection. Finally, we give a further, equivalent definition of each kind of partition by means of analogues of equivalence relations.
KeywordsEquivalence Class Binary Relation Distributive Lattice Satisfying Condition Factorisation System
Unable to display preview. Download preview PDF.
- Adámek, J., Herrlich, H., Strecker, G. E. (2004), Abstract and Concrete Categories - The Joy of Cats, electronic edition.Google Scholar
- Codara, P. (2008), A theory of partitions of partially ordered sets. Ph.D. Diss., Milan, Università degli Studi di Milano.Google Scholar
- Codara, P., D’Antona, O., Marra, V. (2009), Open Partitions and Probability Assignments in Gödel Logic, in ECSQARU 2009, LNCS (LNAI), in press.Google Scholar