A normal form algorithm for modules over \(k[x,y]/\langle xy \rangle\) (Q1815025)

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 941289
Language Label Description Also known as
default for all languages
No label defined
    English
    A normal form algorithm for modules over \(k[x,y]/\langle xy \rangle\)
    scientific article; zbMATH DE number 941289

      Statements

      A normal form algorithm for modules over \(k[x,y]/\langle xy \rangle\) (English)
      0 references
      0 references
      0 references
      1 February 2002
      0 references
      The authors give an algorithm to classify finitely generated modules over the ring \(R:=k[x,y]/\langle xy \rangle ,\) where \(k\) is any field. This algorithm generalizes the Smith normal form algorithm for a matrix over a polynomial ring in one variable. The authors study is motivated by the work of \textit{L. S. Levy} [J. Algebra 71, 62-114 (1981; Zbl 0508.16009) and 93, 1-116 (1985; Zbl 0564.13010)]. They derive an algorithmic version of Levy's results for \(R\). The following application to a problem in linear algebra is given: Compute the normal form of a pair of mutually annihilating \(n \times n\) matrices over \(k\) (i.e. \(C, D \in k^{n\times n}\) verifying \(CD=DC=0\)), under the action of the general linear group \((C,D) \mapsto (U^{-1} C U , U^{-1} D U)\), \(U\in GL(n,k)\). In particular, when \(D=0\), the rational form of any square matrix \(C\) can be read off the output of the proposed algorithm.
      0 references
      Smith normal form
      0 references
      modules over Dedekind-like rings
      0 references
      Gröbner basis
      0 references
      mutually annihilating linear operators
      0 references
      algorithm to classify finitely generated modules
      0 references
      normal form of a pair of mutually annihilating matrices
      0 references

      Identifiers

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