Repository | Book | Chapter
A formal theory of resultants (i)
an algorithm in invariant theory
pp. 267-314
Abstract
Let A = a < b < … be an infinite alphabet of negative letters, and let P = u 1 < u 2 < ⋯ < u n be an alphabet containing n negative places. The elements of the letterplace alphabet
Publication details
Published in:
Crapo Henry, Senato Domenico (2001) Algebraic combinatorics and computer science: a tribute to Gian-Carlo Rota. Dordrecht, Springer.
Pages: 267-314
DOI: 10.1007/978-88-470-2107-5_12
Full citation:
Rota Gian-Carlo, 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, 267–314.