Two listing of binary words and Gray codes for $132$-$312$ avoiding permutations
Masaya Tomie · arXiv (Cornell University) · 2016
In this paper, we give two listings for binary words of given length. From this, we provide two Gray codes for $132$-$312$-avoiding permutations of given size, in which two adjacent permutations differ by at most two adjacent transpositions and two adjacent transpositions jumps do not appear successively.