Friday, September 27, 2013

[xehtszkr] Investigating the permutation graph

Given a small set of permutation operations, form the Cayley graph of achievable permutations generated by repeated operation.  What is the diameter of the graph?  Are all permutations possible?  What additional operation would most shrink the diameter?  What is the average distance between two nodes?

Can get interesting groups like Mathieu M12.

Motivation is shuffling bits.

No comments :