Timeline for (Non-trivial) presentation of general linear and symplectic group over Z/mZ?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 10, 2011 at 14:11 | comment | added | user5117 | This comment is woefully late, but let me make it anyway for the benefit of future readers: the integer symplectic groups Sp(2n,Z) are generated by 2 matrices for all n. References are Stanek (Math Review MR0153748) for n>3 and Ishibashi (MR1367845) for n=2,3. In my experience of computer experiments, it seems to speed things up to have as small a generating set as possible. | |
| Nov 23, 2009 at 4:19 | answer | added | Andy Putman | timeline score: 9 | |
| Nov 22, 2009 at 18:00 | answer | added | D. Savitt | timeline score: 9 | |
| Nov 22, 2009 at 17:18 | history | edited | user717 | CC BY-SA 2.5 |
edited title; added 108 characters in body; deleted 3 characters in body
|
| Nov 22, 2009 at 17:17 | comment | added | user717 | Well, good point. I'm looking of course for a presentation with less elements than the group order. Something that makes it possible (at least for small n and m) to determine/handle these groups with a computer without doing this by brute force. | |
| Nov 22, 2009 at 16:30 | comment | added | Ian Agol | Any finite group has a finite presentation - just take generators all elements of the group, and relations from the multiplication table. GAP probably computes directly with matrices. Maybe you should clarify your question - what sort of presentation are you looking for? | |
| Nov 22, 2009 at 13:08 | history | asked | user717 | CC BY-SA 2.5 |