An upper bound on the number of monomials in the Sylvester resultant

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An upper bound on the number of monomials in the Sylvester resultant

Full text

Pdf (192 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1993 international symposium on Symbolic and algebraic computation table of contents

Kiev, Ukraine

Pages: 161 - 163

Year of Publication: 1993

ISBN:0-89791-604-2

Author

Michael Kalkbrener

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 11, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/164081.164116 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Aig75	M. Aigner. Kombinatorik I (in German}. Springer, Berlin Heidelberg New York, 1975.
	And87	I. Anderson. Combinatorics of Finite Sets. Clarendon Press, Oxford, 1987.
	GKZ90	I.M. Gelfand, M.M. Kapranov, and A.V. Zelevinsky. Newton polytopes of the classical resultant and discriminant. Adv. in Math., 84(2):237-254, 1990.
	Sta80	R.P. Stanley. Weyl groups, the hard Lefschetz theorem, and the Sperner property. SIAM J. Alg. Disc. Meth., 1(2):168-184, 1980.
	Sta86	R P Stanley, Enumerative combinatorics, Wadsworth Publ. Co., Belmont, CA, 1986
	vdW71	B.L. van der Waerden. Algebra I (in German). Springer, Berhn Heidelberg New York, 8. edition, 1971.