6533b85efe1ef96bd12c0403
RESEARCH PRODUCT
Gray code for Cayley permutations
J.-l. Barilsubject
[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]PermutationsCombinationslcsh:Electronic computers. Computer scienceWeak-orderlcsh:QA75.5-76.95ComputingMilieux_MISCELLANEOUSGray Codedescription
A length-n Cayley permutation p of a total ordered set S is a length-n sequence of elements from S, subject to the condition that if an element x appears in p then all elements y < x also appear in p . In this paper, we give a Gray code list for the set of length-n Cayley permutations. Two successive permutations in this list differ at most in two positions.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2003-10-01 |