An atomic model of the graph of permutations linked by transpositions
The authors study the Cayley graph for the symmetric group, generated by transpositions. (This graph has relevance in campanology as well, but the authors do not investigate this connection.) They note that minimal product length in generators is determined by cycle structure; thus a partition of permutations by minimal word length can be refined into a partition by conjugacy classes. The author study (using language borrowed from the theory of atoms) such ``shells of elements of same minimal word length, as well as connections between different shells. Using standard ``energy minimization methods, They study how these graphs could be embedded, for \(n=3,4\) into \(\mathbb{R}^3\) in pleasing configurations and illustrate these through images. (It is noted that this approach performs less well in degree 5.)
- Transposition graphs: an intuitive approach to the parity theorem for permutations
- On permutation graphs
- scientific article; zbMATH DE number 1457239
- A transposition factorization of walk-permutations in graphs
- A theorem on permutation graphs with applications
- Permutations in Coinductive Graph Representation
- Transitivity and connectivity of permutations
- A permutation model with finite partitions of the set of atoms as supports
- The combinatorial compound of permutation matrix and graphical representation
- scientific article; zbMATH DE number 3995734
This page was built for publication: An atomic model of the graph of permutations linked by transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2090136)
