Timeline for working with symmetric groups presented via nonstandard generators
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2018 at 15:58 | comment | added | Vladimir Dotsenko | @DerekHolt thank you for the comment! You certainly are one of people whose input on the matter is absolutely invaluable. Short SLPs are completely fine with me, and in fact the "length 800" claim in my post is rather the length of the corresponding SLPs (that I computed with Magma). My general issue is that everything that I can compute, within my very limited knowledge of the field, seems to be much longer than the "expected" length, and this worries me. | |
| Mar 26, 2018 at 13:01 | comment | added | Derek Holt | I realize that you want tofind reasonably short words for elements of $S_n$ in a given generating set, but it is worth observing that, in many of the applications to computational group theory, we do not try to do that, partly because it is just too difficult. Instead, we write them as short straight line programs in the given generating set, which means that we can define new generators as short words in existing generators, and use them when writing elements as words in the generators. In some contexts, such as evaluating images of elements under homomorphisms, this is very effective. | |
| Mar 26, 2018 at 12:52 | history | edited | Vladimir Dotsenko | CC BY-SA 3.0 |
added 218 characters in body
|
| Mar 26, 2018 at 11:42 | history | asked | Vladimir Dotsenko | CC BY-SA 3.0 |