A formal theory of resultants (i)

Rota Gian-Carlo; Stein J A

Book | Chapter

(2001) Algebraic combinatorics and computer science, Dordrecht, Springer.

A formal theory of resultants (i)

an algorithm in invariant theory

Gian-Carlo Rota, J A Stein

pp. 267-314

Let A = a < b < … be an infinite alphabet of negative letters, and let P = u ₁ < u ₂ < ⋯ < u _n be an alphabet containing n negative places. The elements of the letterplace alphabet

Publication details

DOI: 10.1007/978-88-470-2107-5_12

Full citation:

Rota, , Stein, J.A. (2001)., A formal theory of resultants (i): an algorithm in invariant theory, in H. Crapo & D. Senato (eds.), Algebraic combinatorics and computer science, Dordrecht, Springer, pp. 267-314.

This document is unfortunately not available for download at the moment.