Balanced Gray Codes for Permutations and Rainbow Cycles for Associahedra

Robert Lauff, Lucca Tiemens

We settle the problem of constructing a balanced transposition Gray code for permutations of $[n]:=\{1,\dots ,n\}$ with $n\in \mathbb{N}\setminus \{0\}$. More generally, we obta…