Skip to main content
    • Aa
    • Aa

The number of preference orderings: a recursive approach

  • Ben Eggleston (a1)
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

5. J. P. Barthelemy , An asymptotic equivalent for the number of total preorders on a finite set, Discrete Mathematics 29 (1980) pp. 311313.

6. R. W. Bailey , The number of weak orderings of a finite set, Social Choice and Welfare 15 (1998) pp. 559562.

8. A. C. Aitken , A problem in combinations, Edinburgh Mathematical Notes 28 (1933) pp. xviiixxiii.

9. L. Comtet , Advanced combinatorics: the art of finite and infinite expansions (revised edition), D. Reidel Publishing Company, Dordrecht, Holland (1974).

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Mathematical Gazette
  • ISSN: 0025-5572
  • EISSN: 2056-6328
  • URL: /core/journals/mathematical-gazette
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 10 *
Loading metrics...

Abstract views

Total abstract views: 93 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th September 2017. This data will be updated every 24 hours.