[top][index]
search for:

degree -- the degree

degree X -- returns the degree of a polynomial, vector, matrix, monomial, or module.

The degree may be an integer, or a vector of integers. The length of that vector is referred to as the 'number of degrees', and is provided by degreeLength.

i1 : R = ZZ/101[x,y,z]

o1 = R

o1 : PolynomialRing
i2 : degree (x^2+y^2)^5

o2 = {10}

o2 : List
i3 : F = R^{2,3,4}

      3
o3 = R

o3 : R-module, free, degrees {-2, -3, -4}
i4 : v = F_2

o4 = <2>

      3
o4 : R
i5 : degree v

o5 = {-4}

o5 : List

The degree of a module of finite length is the same as its length.

i6 : degree cokernel symmetricPower ( 2, vars R )

o6 = 4

Implemented with a method of the same name.

Ways to use degree :

  • degree CC
  • degree ChainComplexMap
  • degree CoherentSheaf
  • degree GradedModuleMap
  • degree Ideal
  • degree Matrix
  • degree Module
  • degree MonomialIdeal
  • degree ProjectiveHilbertPolynomial
  • degree ProjectiveVariety
  • degree QQ
  • degree Ring
  • degree RingElement
  • degree RR
  • degree Vector
  • degree ZZ

  • [top][index]
    search for: