Algorithms for group actions in arbitrary characteristic and a problem in singularity theory (Q2175226)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Algorithms for group actions in arbitrary characteristic and a problem in singularity theory
    scientific article

      Statements

      Algorithms for group actions in arbitrary characteristic and a problem in singularity theory (English)
      0 references
      0 references
      0 references
      28 April 2020
      0 references
      Let \(K\) be a field and \(R=K[[x_1,\ldots,x_s]]\) with maximal ideal \(\mathfrak{m}=\langle x_1,\ldots,x_s\rangle\). Let \(M_{m,n}\) be the set of all \(m\times n\) matrices with entries in \(R\). Let \(G\) be one of the following groups \(\mathcal R:= \text{Aut}(R)\),\(\mathcal G_l:=\text{Gl}(m,R)\rtimes\mathcal R\),\(\mathcal G_r:=\text{Gl}(m,R)^{op}\rtimes\mathcal R\) or \(\mathcal G_{lr}:=(\text{Gl}(m,R)\times\text{Gl}(m,R)^{op})\rtimes\mathcal R\). \(G\) acts on \(M_{m,n}\) as follows \((\varPhi,A) \longmapsto\varPhi(A)\), \((U,\varPhi,A) \longmapsto U\varPhi(A)\), \((V,\varPhi,A) \longmapsto\varPhi(A)V\) or \((U,V,\varPhi,A) \longmapsto U\varPhi(A)V\). Two matrices \(A,B \in M_{m,n}\) are called \(G\)-equivalent, \(A\sim B\), if \(B\) lies in the orbit of \(A\). \(A\) is said to be \(G\) \(k\)-determined if for each matrix \(B\in M_{m,n}\) with \(B-A \in\mathfrak{m}^{k+1}M_{m,n}\) we have \(B \sim A\). \(A\) is called finitely \(G\)-determined if \(A\) is \(G\) \(k\)-determined for some \(k\). Algorithms are presented for checking finite determinacy and compute determinacy bounds. If \(A\) is finitely determined algorithms are given to compute the image \(\tilde {\mathcal T}_A(G,A)\) of the tangent map to the orbit map \(G \longrightarrow GA\), which is contained in the tangent space \(\mathcal T_A(GA)\) of the orbit \(GA\). Both spaces may be different in positive characteristic. It is proved that equality holds iff the orbit map is separable. An example for a non-separable orbit map is given.
      0 references
      no-separable group action in positive characteristic
      0 references
      algorithms for determinacy
      0 references
      tangent image
      0 references
      tangent space
      0 references
      right and contact equivalence in positive characteristic
      0 references

      Identifiers