bio | website | math.uic.edu/~ddumas |
---|---|---|
location | ||
age | ||
visits | member for | 3 years, 8 months |
seen | Apr 10 at 15:23 | |
stats | profile views | 95 |
Oct 18 |
comment |
Algorithm to test for discrete or quasi-Fuchsian subgroups of PSL(2,C)
Real computation is what I had in mind. Certainly I would want to allow computing words in the generators of $\rho(\Gamma)$ and comparisons between traces or matrix entries as "basic operations". Thanks for your answers, which convince me there is no hope for an algorithm in general. As in the punctured torus case, when actually implementing such a test I will need to settle for heuristics that leave a thin set in the character variety "undecided". |
Oct 18 |
awarded | Scholar |
Oct 18 |
awarded | Editor |
Oct 18 |
accepted | Algorithm to test for discrete or quasi-Fuchsian subgroups of PSL(2,C) |
Oct 18 |
comment |
Algorithm to test for discrete or quasi-Fuchsian subgroups of PSL(2,C)
I edited the last sentence to clarify that I am interested in the closed surface case. |
Oct 18 |
revised |
Algorithm to test for discrete or quasi-Fuchsian subgroups of PSL(2,C)
added 4 characters in body |
Oct 18 |
awarded | Student |
Oct 18 |
asked | Algorithm to test for discrete or quasi-Fuchsian subgroups of PSL(2,C) |
Mar 4 |
answered | Families of Fuchsian models |
Aug 5 |
awarded | Teacher |
Aug 5 |
answered | Local vs. infinitesimal rigidity |