[next][up][top][index]
search for:
rings

An overview

Macaulay 2 differs from computer algebra systems such as maple and mathematica, in that rings are first class objects. This means that before making polynomials or matrices, you must create a ring where you give the variables that you want, and the kinds of coefficients you want (e.g. rational numbers, or integers modulo a prime number).
  • basic rings
  • finite fields

  • polynomial rings
  • monomial orderings
  • quasi- and multi-graded polynomial rings
  • quotient rings
  • manipulating polynomials
  • factoring polynomials

  • fields
  • finite fields, part II
  • fraction fields
  • finite field extensions

  • other algebras
  • exterior algebras
  • symmetric algebras
  • tensor products of rings
  • Weyl algebras
  • Schur rings -- monomials represent irreducible representations of GL(n)
  • associative algebras

    • For additional common operations and a comprehensive list of all routines in Macaulay 2 which return or use rings, see Ring.

    [next][up][top][index]
    search for: