pith. sign in

arxiv: 1703.08241 · v2 · pith:2UWU4HWInew · submitted 2017-03-23 · 🧮 math.AG · math.RT

Rank 1 character varieties of finitely presented groups

classification 🧮 math.AG math.RT
keywords algorithmcoordinatefinitefinitelygrouppresentationrankring
0
0 comments X
read the original abstract

Let X(F,G) be the G-character variety of F where G is a rank 1 complex affine algebraic group and F is a finitely presentable discrete group. We describe an algorithm, which we implement in Mathematica, SageMath, and in Python, that takes a finite presentation for F and produces a finite presentation of the coordinate ring of X(F,G). We also provide a new description of the defining relations and local parameters of the coordinate ring when F is free. Although the theorems used to create the algorithm are not new, we hope that as a well-referenced exposition with a companion computer program it will be useful for computation and experimentation with these moduli spaces.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.