Name
Abstract | ||
|---|---|---|
We give the n! permutations of [n]={1,2,…,n} a cyclic order inspired by the childrenʼs game of Hot Potato. Our order is a transposition Gray code, meaning that consecutive permutations differ by a single transposition. Furthermore, each transposition is restricted in two ways: (1) It must transpose value n (the “hot potato”); (2) It must transpose positions that are circularly adjacent or semi-adjacent. In other words, if each permutation is written circularly, then our order repeatedly transposes the value n with a value that is one or two positions to its left or right. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.endm.2013.10.014 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Gray code,permutation,star transposition,adjacent transposition,vertex transitive graph,Hamilton cycle,Lovász conjecture | Transposition (music),Discrete mathematics,Combinatorics,Cyclic order,Transpose,Permutation,Gray code,Mathematics | Journal |
Volume | ISSN | Citations |
44 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xi Sisi Shen | 1 | 0 | 0.34 |
| Aaron Williams | 2 | 139 | 20.42 |