In [S. Effler, F. Ruskey, A CAT algorithm for listing permutations with a given number of inversions, { \it I.P.L.}, 86/2 (2003)] the authors give an algorithm, which appears to be CAT, for generating permutations with a given major index. In the present paper we give a new algorithm for generating a Gray code for subexcedant sequences. We show that this algorithm is CAT and derive it into a CAT generating algorithm for permutations with a given major index.
Categories: math.CO