AbstractI 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  and Stanley's results , 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
|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|
Recommend this item
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.