Finite partially ordered set and some of its properties
DOI:
https://doi.org/10.3126/bibechana.v13i0.13985Keywords:
Poset, ferrers shape, duality theorem, functionality, recursive computation.Abstract
This paper focuses on some main properties of the finite partially ordered sets. These properties are furnished in the form of theorems. Here we have presented three such theorems. The first theorem is called as ‘duality theorem’. This fundamental theorem was first obtained by Greene. Few years later it was rediscovered and given an alternative proof by Fomin. The second theorem bestows the functionality property. The proof of this was also done by Greene. However, Gansner gave an alternative proof of the theorem taking advantage of a connection between poset and linear algebra. The proof of the third theorem is fully due to us. This theorem gives rise to a recursive computation of the shape. In the present paper we have discussed the first two properties through suitable illustrations only whereas a complete proof is furnished for the last one.
BIBECHANA 13 (2016) 126-130
Downloads
Downloads
Published
How to Cite
Issue
Section
License
This license enables reusers to distribute, remix, adapt, and build upon the material in any medium or format for noncommercial purposes only, and only so long as attribution is given to the creator.