Repository | Book | Chapter
(2009) From combinatorics to philosophy, Dordrecht, Springer.
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.
Publication details
DOI: 10.1007/978-0-387-88753-1_4
Full citation:
Codara, P. (2009)., Partitions of a finite partially ordered set, in E. Damiani, V. Marra & F. Palombi (eds.), From combinatorics to philosophy, Dordrecht, Springer, pp. 45-59.
This document is unfortunately not available for download at the moment.