Repository | Book | Chapter
(2001) Algebraic combinatorics and computer science, Dordrecht, Springer.
A formal theory of resultants (ii)
a constructive definition of the resultant
Gian-Carlo Rota, J A Stein
pp. 315-342
Let A and P denote negative alphabets so that the supersymmetric algebra Super[A|P] is an ordinary polynomial algebra in the neutral elements [a|u] for a in A and u in P.
Publication details
DOI: 10.1007/978-88-470-2107-5_13
Full citation:
Rota, , Stein, J.A. (2001)., A formal theory of resultants (ii): a constructive definition of the resultant, in H. Crapo & D. Senato (eds.), Algebraic combinatorics and computer science, Dordrecht, Springer, pp. 315-342.
This document is unfortunately not available for download at the moment.