Timeline for Are finite presentations of arithmetic groups computable?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2018 at 15:20 | comment | added | NWMT | @IgorRivin Okay, I had a closer look at the references you provided and your answer. Do the results of the two first papers you cite pertain to the groups in my question in full generality? The answer is not obvious to me as a non-expert. | |
| Sep 28, 2018 at 19:59 | history | edited | Igor Rivin | CC BY-SA 4.0 |
explained point
|
| Sep 28, 2018 at 19:57 | comment | added | Igor Rivin | @NWMT (and of course the last reference has presentations in the title, so does compute them (also practically). | |
| Sep 28, 2018 at 19:57 | comment | added | Igor Rivin | Someone downvoted this answer? | |
| Sep 28, 2018 at 19:56 | comment | added | Igor Rivin | @NWMT I should probably move this to the main answer, but the point is this: using their methods you can bound the volume (since you can find the congruence depth), and then (at least in the special linear and symplectic case you can use the Minkowski model (the PSD cone) of the symmetric space to construct the fundamental polyhedron (the bound tells you when to stop), so pretty much what you are asking for. | |
| Sep 28, 2018 at 19:20 | comment | added | NWMT | Right, I saw those results. They actually go further and present algorithms that actually work on computers, but only for restricted classes. That being said I don't think they compute presentations; I could have misunderstood their results though, since I'm not an expert. | |
| Sep 28, 2018 at 17:27 | history | edited | Igor Rivin | CC BY-SA 4.0 |
added reference
|
| Sep 28, 2018 at 16:24 | comment | added | Andy Putman | Though the two papers you cite have something to do with computational questions involving arithmetic groups, they do not appear to have anything to do with the specific question the OP asked. | |
| Sep 28, 2018 at 16:06 | history | answered | Igor Rivin | CC BY-SA 4.0 |