Rank 1 character varieties of finitely presented groups (Q684199)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Rank 1 character varieties of finitely presented groups
    scientific article

      Statements

      Rank 1 character varieties of finitely presented groups (English)
      0 references
      0 references
      0 references
      0 references
      9 February 2018
      0 references
      This paper under review deals with rank 1 character varieties of finitely presented groups. In this article, \(\Gamma\) is a finitely presentable discrete group and \(\chi(\Gamma ,G)\) is the \(G\) character variety of \(\Gamma\) where \(G\) is a rank 1 complex affine algebraic group. An effective algorithm is presented in order to determine the structure of the variety \(\chi(\Gamma, G)\). More precisely, the proposed algorithm takes a finite presentation for \(\Gamma\) and produces a finite presentation of the coordinate ring of \(\chi(\Gamma,G)\). The implementations in Mathematica, as well in Python and SageMath are given. Known theorems of Vogt, Horowitz, Magnus, Gonzalez-Acuna and Montesinos-Amilibia, Brumfiel-Hilden and Drensky are used for the construction of the algorithm. Assuming that \(G=\mathrm{SL}_2(\mathbb{C})\), it provides a new proof and a new description of the structure of \(\mathrm{SL}_2\) character varieties. In the last section of this paper, concrete examples are provided and it is shown that using this algorithm, known results are verified.
      0 references
      character variety
      0 references
      effective algorithm
      0 references
      rank 1 Lie group
      0 references
      finitely presented group
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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