Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-25T06:06:37.790Z Has data issue: false hasContentIssue false

Generalised discriminants

Published online by Cambridge University Press:  17 April 2009

C. F. Woodcock
Affiliation:
Institute of Mathematics and StatisticsUniversity of Kent, CanterburyKent CT2 7NFEngland
P. R. Graves-Morris
Affiliation:
Department of Mathematics and Statistics, University of Canterbury, Private Bag 4800ChristchurchNew Zealand
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, we establish the generalized discriminant theorem governing uniqueness of symmetric polynomials in n variables of least total degree dn, k which vanish when any k + 1 of the variables are equal.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1996

References

[1]Graves-Morris, P.R., ‘Problem 92–20’, SIAM Review 34 (1992), 649650.CrossRefGoogle Scholar
[2]Lang, S., Algebra, Chapter 5 Section 9 (Addison-Wesley, Reading, Mass., 1967).Google Scholar
[3]Macdonald, I.G., Symmetric functions and Hall Polynomials (Oxford University Press, Oxford, 1979).Google Scholar
[4]Marcus, M., Introduction to modern algebra (Dekker, New York, 1978).Google Scholar
[5]Pragacz, P., ‘A note on the elimination theory’, Nederl. Akad. Wetensch. Indag. Math. 49 (1987), 215221.CrossRefGoogle Scholar
[6]Wilson, R.J., Introduction to graph theory (Longman, London, 1985).Google Scholar
[7]Woodcock, C.F. and Graves-Morris, P.R., ‘Solution to Problem 92–20’, SIAM Review 35 (1993), 649651.CrossRefGoogle Scholar