An efficient Gray code algorithm for generating all permutations with a given major index

Vincent Vajnovszki (1)

1 Le2i - Laboratoire Electronique, Informatique et Image [UMR6306]

In Effler and Ruskey (2003) [1] 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 modify it into a CAT generating algorithm for a Gray code for permutations with a given major index.

Mots clés: Generating algorithms permutations? (Bounded) compositions of an integer; Major index

Domaines: Combinatoire [math.CO]

Vincent Vajnovszki. An efficient Gray code algorithm for generating all permutations with a given major index. Journal of Discrete Algorithms, 2014, 26, pp.77-88. ⟨10.1016/j.jda.2014.01.001⟩. ⟨hal-01001561⟩