Timeline for How to return elements of a given length in a symmetric group using Sage?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 26, 2017 at 20:05 | vote | accept | Jianrong Li | ||
| Jan 24, 2017 at 9:01 | comment | added | Martin Rubey | doc.sagemath.org/html/en/reference/combinat/sage/combinat/… | |
| Jan 23, 2017 at 15:32 | comment | added | Jianrong Li | @Martin Rubey, thank you very much. Are there some software for Lehmer codes? | |
| Jan 23, 2017 at 15:25 | comment | added | Martin Rubey | Lehmer codes with given sum might be quick to generate. | |
| Jan 23, 2017 at 15:13 | comment | added | Jianrong Li | thank you very much. Your method solved the problem. But when the group is very large, for example, $S_{16}$. It will take a long time to compute G = CoxeterGroup(CM, base_ring=ZZ). Is it possible to list the elements of length $m$ directly? | |
| Jan 23, 2017 at 14:58 | history | answered | Thomas Kahle | CC BY-SA 3.0 |