6533b85bfe1ef96bd12ba98e

RESEARCH PRODUCT

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

Vincent Vajnovszki

subject

Discrete mathematicsCombinatoricsGray codeComputational Theory and MathematicsDiscrete Mathematics and CombinatoricsMajor indexAlgorithmTheoretical Computer ScienceMathematics

description

Abstract 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.

https://doi.org/10.1016/j.jda.2014.01.001