Propagating weights of tori along free resolutions (Q898242)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6517831
Language Label Description Also known as
default for all languages
No label defined
    English
    Propagating weights of tori along free resolutions
    scientific article; zbMATH DE number 6517831

      Statements

      Propagating weights of tori along free resolutions (English)
      0 references
      0 references
      8 December 2015
      0 references
      The author studies the problem of extending the action of an algebraic torus on a graded module over a polynomial ring to the minimal free resolution of the module. The article is divided into four sections. The first one provides a longer introduction into the problem and treats without much technical details a simple example. The second section collects the needed concepts and results from commutative algebra on one hand and representation theory on the other hand. The main emphasis is on introducing a category where the objects are finitely generated graded polynomial modules equipped with a torus action which is compatible with the grading and with multiplication and the morphisms are graded equivariant module homomorphisms. Furthermore, free modules in this category are studied in details and the existence of minimal resolutions is shown. The third section presents the theoretical basis for the algorithms designed in the fourth section. It studies in details the propagation of weights along a resolution. This is done first for maps which are expressed with respect to bases consisting of weight vectors. Then the general case is considered under some mild assumptions. The fourth section is by far the largest one and makes up about half of the article. It provides algorithms for four problems. The first one recovers weights for the domain of a map given those of the codomain, whereas the second one works in the opposite direction. Based on these two algorithms, a third one propagates weights given for one module in a minimal resolution along the remainder of the resolution. The fourth algorithm recovers the weights of graded components of a module given a presentation of it. Finally, computations over a subfield are considered.
      0 references
      polynomial module
      0 references
      equivariant free resolution
      0 references
      irreducible representation
      0 references
      weight
      0 references
      torus
      0 references
      reductive group
      0 references
      algorithm
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references