Skip to main content
SpringerLink
Log in

A formal theory of resultants (I): an algorithm in invariant theory

  • Chapter
Algebraic Combinatorics and Computer Science

  • 1022 Accesses

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cayley, A. (1889-1898): The collected mathematical papers of Arthur Cayley, vols. 1-14. Cambridge University Press, Cambridge

    Google Scholar 

  2. Cullis, C. E. (1913-1925): Matrices and determinoids. Cambridge University Press, Cambridge

    Google Scholar 

  3. Gel’fand, I.M., Kapranov, M.M., Zelevinsky, A.V. (1994): Discriminants, resultants and multidimensional determinants. Birkhäuser Boston, Boston, MA

    Book  MATH  Google Scholar 

  4. Grosshans, F., Rota, G.-C., Stein, J. A. (1987): Invariant theory and superalgebras. (CBMS Regional Conference Series in Mathematics, vol. 69). American Mathematical Society, Providence, RI

    Google Scholar 

  5. Mac Mahon, P.A. (1978, 1986): Collected papers I, II. MIT Press, Cambridge, MA

    Google Scholar 

  6. Netto, E. (1896-1900): Vorlesungen über Algebra. Teubner, Leipzig

    Google Scholar 

  7. Rota, G.-C., Stein, J. A. (1994): Plethystic Hopf algebras. Proc. Nat. Acad. Sci. U.S.A. 91, 13057–13061

    Article  MathSciNet  MATH  Google Scholar 

  8. Rota, G.-C., Stein, J. A. (1994): Plethystic algebras and vector symmetric function. Proc. Nat. Acad. Sci. U.S.A. 91, 13062–13066

    Article  MathSciNet  MATH  Google Scholar 

  9. Schinzel, A. (1982): Selected topics on polynomials. University of Michigan Press, Ann Arbor, MI

    MATH  Google Scholar 

Download references

Authors
  1. G.-C. Rota
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. A. Stein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre d’Analyse et Mathematique Sociales, E.H.E.S.S. — C.N.R.S., Paris, France

    H. Crapo

  2. Dipartimento di Matematica, Università della Basilicata, Potenza, Italy

    D. Senato

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Italia

About this chapter

Cite this chapter

Rota, GC., Stein, J.A. (2001). A formal theory of resultants (I): an algorithm in invariant theory. In: Crapo, H., Senato, D. (eds) Algebraic Combinatorics and Computer Science. Springer, Milano. https://doi.org/10.1007/978-88-470-2107-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-88-470-2107-5_12

  • Publisher Name: Springer, Milano

  • Print ISBN: 978-88-470-2159-4

  • Online ISBN: 978-88-470-2107-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation