Timeline for Generators of sections of free groups
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 12, 2013 at 14:30 | vote | accept | Yassine Guerboussa | ||
May 9, 2013 at 16:54 | answer | added | Andy Putman | timeline score: 5 | |
May 9, 2013 at 16:17 | history | edited | Stefan Kohl♦ | CC BY-SA 3.0 |
Corrected spelling and grammar.
|
May 9, 2013 at 15:11 | comment | added | Derek Holt | These numbers can certainly depend on the isomorphism type of $F/H$ (and not just on its order). | |
May 9, 2013 at 12:44 | comment | added | Yassine Guerboussa | Thank you Professor Derek Holt, I would like to know if there is an explicit formula (perhaps depending on d and the index of H) to calculate this number of generators. | |
May 9, 2013 at 12:15 | comment | added | Derek Holt | The answer is yes, in the sense that there are algorithms to solve these problems, and it would not be particularly difficult to write programs in a language like GAP or Magma to do so. Is this what you are looking for, or is this more of a theoretical question? | |
May 9, 2013 at 10:35 | history | asked | Yassine Guerboussa | CC BY-SA 3.0 |