On hyper-regularity and unimodularity of Ore polynomial matrices (Q1797891)

From MaRDI portal





scientific article; zbMATH DE number 6960403
Language Label Description Also known as
default for all languages
No label defined
    English
    On hyper-regularity and unimodularity of Ore polynomial matrices
    scientific article; zbMATH DE number 6960403

      Statements

      On hyper-regularity and unimodularity of Ore polynomial matrices (English)
      0 references
      0 references
      0 references
      22 October 2018
      0 references
      Let \(\mathcal{K}\) be the field of meromorphic functions in \(t\) and put \(\lambda:=d/dt\). The Ore polynomial ring \(\mathcal{K}[\lambda]\) consists of operators which are polynomials of the form \(\sum a_{k}\lambda^{k}\) with \(\alpha_{k}\in\mathcal{K}\); it is noncommutative with the relation \(\lambda a=da/dt+a\lambda\) for all \(a\in\mathcal{K}\). The authors consider matrices over the ring \(\mathcal{K}[\lambda]\). An \(n\times n\) matrix \(U\) is called unimodular if if has an inverse \(V\) over \(\mathcal{K}[\lambda]\) (because the ring is noncommutative, it is possible that \(U\) is unimodular but its transpose is not). An \(m\times n\) matrix \(A\) with \(m\leq n\) is called hyper-regular if there exists an \(n\times m\) pseudo-inverse \(B\) over \(\mathcal{K[\lambda]}\) with \(AB=I_{m}\). There is an analogous definition when \(m\geq n\). The authors show how to determine whether a given matrix is unimodular or hyper-regular (and to find corresponding inverses when they exist) by reducing the problems to computations in linear algebra over the field \(\mathcal{K}\). A computer algorithm is available.
      0 references
      0 references
      polynomial matrices
      0 references
      hyper-regularity
      0 references
      unimodularity
      0 references
      meromorphic functions
      0 references
      differential operator
      0 references
      noncommutativity
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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