AN ALGORITHM TO COUNT RIME N-FREE POSETS

Bayoumi I. Bayoumi , Mohamed H. El-Zahar ; Khamis, Soheir 


Abstract


I n this paper we present five algorithms to count the elements of the c l ass of . So-called, prime N-free posets. Our method is based on the correspondence between super diagonal matrices and N-free posets. According to Pσlya's enumeration theorem [6] and Stanley's results [11], we obtain an efficient method to compute the number of N-free posets by using the results of our program. As a result of our algorithm, the previously known


Other data

Keywords Posets, N-free posets , prime N-free posets, enumeration of N-free posets.
Issue Date 25-Dec-1989
Conference THE 24th ANNUAL CONFERENCE ON STATISTICS, COMPUTER SCIENCE AND OPERATIONS RESEARCH 
URI http://research.asu.edu.eg/123456789/1143


File Description SizeFormat 
An algorithm to Count Prime N-free Posets.pdf780.56 kBAdobe PDFView/Open
Recommend this item

CORE Recommender
6
Views

1
Downloads


Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.