Skip to main content

Recent progress and unsolved problems in dominance theory

Invited Addresses

  • 564 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 686)

Abstract

A survey of (unsolved) combinatorial, algebraic and statistical problems which have arisen since 1950 and are closely related to dominance or majorization.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Principles of Combinatorics, Academic Press, New York, 1971.

    MATH  Google Scholar 

  2. A. Brauer, I. Gentry and K. Shaw, A new proof of a theorm of H.G. Landau on tournament matrices, J. Comb. Th., 1968, 289.

    Google Scholar 

  3. P. Erdös, Colloquium sur la théorie des Nombres, Bruxelles, 1955.

    Google Scholar 

  4. J. Frame, G. deB. Robinson and R.M. Thrall, On the Hook graph of the symmetric group, Can. J. Math, 1954, 316.

    Google Scholar 

  5. G.H. Hardy, E.G. Littlewood and G. Polya, Inequalities, Cambridge Univ. Press, Cambridge, 1952.

    MATH  Google Scholar 

  6. G. Kreweras, Sur une classe de problèmes de dénombrement liés au treillis des partitions d'entiers, Cah. BURO, 1965, 5.

    Google Scholar 

  7. G. Kreweras, Traitement simultané du "Problème de Young" et du "Problème de Simon Newcomb", Cah. BURO, 1967, 3.

    Google Scholar 

  8. H.G. Landau, The conditions for a score structure, Bull. Math. Biophysics, 1953, 143.

    Google Scholar 

  9. E.L. Lehmann, The power of rank tests, Ann. Math. Stat., 1953, 23.

    Google Scholar 

  10. W. Maurer, On most effective tournament plans with fewer matches than players, Ann. Stat., 1975, 717.

    Google Scholar 

  11. J. Moon, Topics in Tournaments, Holt, Reinhart and Winston, New York, 1968.

    MATH  Google Scholar 

  12. J. Moon and N.J. Pullman, Generalised tournament matrices, SIAM Review, 1970, 384.

    Google Scholar 

  13. T.V. Narayana, Sur les treillis formés par les partitions d'un entier et leurs applications à la théorie des probabilités, CR Acad. Sci,, 1955, 1188.

    Google Scholar 

  14. T.V. Narayana, Lattice Path Combinatorics with Statistical Applications, Univ. of Toronto Press, Toronto.

    Google Scholar 

  15. T.V. Narayana and J. Zidek, Contributions to the theory of tournaments II, Rev. (Roum.) des Math. Pures et Appl, 1969, 1563.

    Google Scholar 

  16. E.J.G. Pitman, Simple proofs of Steck's determinantal expressions for probabilities in the Kolmogorov and Smirnov tests, Bull. Aust. Math. Soc., 7, 1972, 227.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. R. Pyke, William-Jeffery Lecture, Can. Math. Cong., 1973.

    Google Scholar 

  18. R. Rasala, On the minimal degrees of characters of Sn, J. Algebra, 1977, 132.

    Google Scholar 

  19. I.R. Savage, Contributions to the theory of rank order tests — the two sample case, Ann. Math. Stat., 1956, 590.

    Google Scholar 

  20. R.P. Stanley, Ordered Structures and Partitions, Memoirs of Amer. Math. Soc., No. 119, 1972.

    Google Scholar 

  21. G.P. Steck, The Smirnov two sample tests as rank tests, Ann. Math. Stat., 1969, 1449.

    Google Scholar 

  22. G.P. Steck, A new formula for P(Ri ≤ bi, 1 ≤ i ≤ m | m, n, f=Gk), Ann. Prob., 1974, 155.

    Google Scholar 

  23. L. Takacs, Combinatorial Methods in the Theory of Stochastic Processes, Wiley, 1967.

    Google Scholar 

  24. B.E. Wynne and T.V. Narayana, Tournament configurations and weighted voting, Cah. BURO, to appear.

    Google Scholar 

  25. A. Young, On quantative substitutional analysis, Proc. London Math. Soc., 1927, 255.

    Google Scholar 

  26. A. Young, Collected Works, Univ. of Toronto Press, Toronto, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Additional information

DEDICATED TO R. PYKE

Rights and permissions

Reprints and Permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Narayana, T.V. (1978). Recent progress and unsolved problems in dominance theory. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062518

Download citation

  • DOI: https://doi.org/10.1007/BFb0062518

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08953-7

  • Online ISBN: 978-3-540-35702-5

  • eBook Packages: Springer Book Archive