Counting linear extension majority cycles in partially ordered sets on up to 13 elements

Computers and Mathematics with Applications

Volumn 59, Issue 4, 2010, Pages 1541-1547

  De Loof, K ^a   De Baets, B ^a   De Meyer, H ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Linear extension; Linear extension majority cycle; Mutual rank probability; Partially ordered set

Indexed keywords

COMPUTER EXPERIMENT; COUNTING LINEAR EXTENSIONS; FREQUENCY ESTIMATES; LINEAR EXTENSIONS; PARTIALLY ORDERED SET;

SET THEORY;

EID: 75349102852     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2009.12.021     Document Type: Article

References (33)

1. Davey B., and Priestley H. Introduction to Lattices and Order (2003), Cambridge University Press, Cambridge
2. De Loof K., De Baets B., and De Meyer H. On the random generation and counting of weak order extensions of a poset with given class cardinalities. Information Sciences 177 (2007) 220-230
3. Kislitsyn S. Finite partially ordered sets and their associated sets of permutations. Matematicheskiye Zametki 4 (1968) 511-518
4. Fishburn P. On the family of linear extensions of a partial order. Journal of Combinatorial Theory, Series B 17 (1974) 240-243
5. Aigner M. Combinatorial Search (1988), Wiley-Teubner, Chichester
6. Fishburn P. On linear extension majority graphs of partial orders. Journal of Combinatorial Theory, Series B 21 (1976) 65-70
7. Fishburn P. Proportional transitivity in linear extensions of ordered sets. Journal of Combinatorial Theory, Series B 41 (1986) 48-60
8. Fishburn P., and Gehrlein W. A comparative analysis of methods for constructing weak orders from partial orders. Journal of Mathematical Sociology 4 (1975) 93-102
9. Ganter B., Hafner G., and Poguntke W. On linear extensions of ordered sets with a symmetry. Discrete Mathematics 63 (1987) 153-156
10. Gehrlein W. The effectiveness of weighted scoring rules when pairwise majority rule cycles exist. Mathematical Social Sciences 47 (2004) 69-85
11. Gehrlein W., and Fishburn P. Linear extension majority cycles for small (n ≤ 9) partial orders. Computers & Mathematics with Applications 20 (1990) 41-44
12. Gehrlein W. Frequency estimates for linear extension majority cycles on partial orders. RAIRO-Operations Research 25 (1991) 359-364
13. Gehrlein W., and Fishburn P. Linear extension majority cycles for partial orders. Annals of Operations Research 23 (1990) 311-322
14. Brightwell G., Fishburn P., and Winkler P. Interval orders and linear extension cycles. Ars Combinatoria 36 (1993) 283-288
15. Ewacha K., Fishburn P., and Gehrlein W. Linear extension majority cycles in height-1 orders. Order 6 (1990) 313-318
16. B. De Baets, H. De Meyer, K. De Loof, On the cycle-transitivity of the mutual rank probability relation of a poset, Fuzzy Sets and Systems (submitted)
17. Kahn J., and Yu Y. Log-concave functions and poset probabilities. Combinatorica 18 (1998) 85-99
18. Yu Y. On proportional transitivity of ordered sets. Order 15 (1998) 87-95
19. Brüggemann R., Simon U., and Mey S. Estimation of averaged ranks by extended local partial order models. MATCH Communications in Mathematical and in Computer Chemistry 54 (2005) 489-518
20. Brüggemann R., and Voigt K. Basic principles of hasse diagram technique in chemistry. Combinatorial Chemistry & High Throughput Screening 11 (2008) 756-769
21. Carlsen L., Lerche D., and Sørensen P. Improving the predicting power of partial order based qsars through linear extensions. Journal of Chemical Information and Computer Sciences 42 (2002) 806-811
22. De Loof K., De Baets B., and De Meyer H. A hitchhiker's guide to poset ranking. Combinatorial Chemistry & High Throughput Screening 11 (2008) 734-744
23. De Loof K., De Meyer H., and De Baets B. Graded stochastic dominance as a tool for ranking the elements of a poset. In: Lawry J., Miranda E., Bugarin A., Li S., Gil M., Grzegorzewski P., and Hyrniewicz O. (Eds). Soft Methods for Integrated Uncertainty Modelling. Advances in Soft Computing (2006), Springer-Verlag, Berlin 53-60
24. Lerche D., and Sørensen P. Evaluation of the ranking probabilities for partial orders based on random linear extensions. Chemosphere 53 (2003) 981-992
25. Lerche D., Sørensen P., and Brüggemann R. Improved estimation of the ranking probabilities in partial orders using random linear extensions by approximation of the mutual ranking probability. Journal of Chemical Information and Computer Science 43 (2003) 1471-1480
26. Patil G., and Taillie C. Multiple indicators, partially ordered sets, and linear extensions: Multi-criterion ranking and prioritization. Environmental and Ecological Statistics 11 (2004) 199-228
27. De Loof K., De Meyer H., and De Baets B. Exploiting the lattice of ideals representation of a poset. Fundamenta Informaticae 71 (2006) 309-321
28. Brinkmann G., and McKay B. Posets on up to 16 points. Order 19 (2002) 147-179
29. Habib M., Medina R., Nourine L., and Steiner G. Efficient algorithms on distributive lattices. Discrete Applied Mathematics 110 (2001) 169-187
30. Varol Y., and Rotem D. An algorithm to generate all topological sorting arrangements. The Computer Journal 24 (1981) 83-84
31. Brightwell G., Felsner S., and Trotter W. Balancing pairs and the cross product conjecture. Order 12 (1995) 327-349
32. Brightwell G. Balanced pairs in partial orders. Discrete Mathematics 201 (1999) 25-52
33. M. Peczarski, Computer assisted research of posets, Ph.D. Thesis, University of Warsaw, 2006