4 ms·
Permutation Group Visualizer
- marktangotango 3y agoVery nice, very satisfying. I was surprised the back button remembered history; not saying good or bad, just surprising.
- liorben-david 3y agoThis is awesome!
- threatofrain 3y agoIs anyone aware of where to begin reading for heuristics or algorithms for finding a Hamiltonian circuit in the Cayley graph of a symmetric group?
- steppi 3y agoYes, checkout the Steinhaus-Johnson-Trotter algorithm [0]. [0] https://en.m.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm https://en.m.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2...
- tromp 3y agoChoose one of the Cyclic Groups, and try clicking the generator "a" button at different speeds. It keeps track of how many times you've clicked and directs each disc straight toward its ultimate destination, causing a pleasing tightening of the disc circle...
- ada1981 3y agoUnrelated but the other day I had a vision of a cartoon about a bunch of Cats with a punk rock band from Chernobyl called The Purr-mutations.
- version_five 3y agoIsnt there a famous book with Johny Chernobyl and the Meltdowns or a similar band name as part of the plot. It will come to me shortly... Edit: I'm thinking of snow crash, I think I have some details wrong though
- gilleain 3y agoThere's also 'Group Explorer' by Nathan Carter. https://nathancarter.github.io/group-explorer/index.html https://nathancarter.github.io/group-explorer/index.html The book is also very nice. edit: Oh right, that's linked from this page ...
- henearkr 3y agoSomething is weird: for example with the dihedral group D2, it shows two identical generators (1 2) and (1 2), which is wrong, as the generators must be different permutations.
- deleted 3y ago[deleted]
- steppi 3y agoD1 and D2 are a little weird. The way they’re usually defined, they can’t be defined as subgraphs of S1 and S2 respectively. See this relevant stackexchange answer [0]. By the symmetry of the n-gon you should, in this case, think of the group of all the isometries of the plane that fix the outline of the n-gon. For n=1 there are two such isometries, namely the identity and the reflection through the midline. What’s being shown in the linked visualizer is actually the action of D2 on the labeled vertices of a 2-gon. I suspect two identical generators are shown because this is how each of the two generators of D2 (180 degree rotation and reflection about midpoint of 2-gon) act on the vertices. [0] https://math.stackexchange.com/questions/470570/the-small-dihedral-groups-d-1-and-d-2 https://math.stackexchange.com/questions/470570/the-small-di...
- andybak 3y agotesseralis also has a fantastic Polyhedra Viewer app: https://polyhedra.tessera.li/ https://polyhedra.tessera.li/ (although it more than just "view")
- coderedart 3y agoCan someone eli5 this for me? I have no idea what i am looking at