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
| Title | AN ALGORITHM TO COUNT RIME N-FREE POSETS | Authors | Bayoumi I. Bayoumi , Mohamed H. El-Zahar ; Khamis, Soheir | 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 |
Attached Files
| File | Description | Size | Format | |
|---|---|---|---|---|
| An algorithm to Count Prime N-free Posets.pdf | 780.56 kB | Adobe PDF | View/Open |
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.