Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-24T14:38:45.439Z Has data issue: false hasContentIssue false
  • English
  • Français

88.61 An inequality by ‘rank and file’ methods

Published online by Cambridge University Press:  01 August 2016

Finbarr Holland
Finbarr Holland*
Affiliation:
Department of Mathematics, University College Cork, Cork, Ireland e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Information
The Mathematical Gazette , Volume 88 , Issue 513 , November 2004 , pp. 522 - 524
Copyright
Copyright © The Mathematical Association 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Abbott, Steve, Rank and file: vision and visualisations, Math. Gaz. 85 (November 2001) pp. 386–402.CrossRefGoogle Scholar
2. Taylor, P. J. (ed.), Tournament of the towns 1984–1989, Australian International Centre for Mathematics Enrichment (1992).Google Scholar
3. Hardy, G., Littlewood, J. E. and Polya, G., Some simple inequalities satisfied by convex functions, Messenger of Math. 58 (1929) pp. 145–152.Google Scholar