RO EN
Gray Code for Cayley Permutations
Authors: J.-L. Baril
Keywords: Weak-order, Gray Code, Permutations, Combinations.
– 0.23 Mb
Keywords: Weak-order, Gray Code, Permutations, Combinations.
Abstract
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.J.-L. Baril,
LE2I, UMR-CNRS 5158, Universite de Bourgogne
BP 47870, 21078 Dijon cedex, France
E-mail:
LE2I, UMR-CNRS 5158, Universite de Bourgogne
BP 47870, 21078 Dijon cedex, France
E-mail:
Fulltext
– 0.23 Mb
Contents
- Polynomial time algorithm for solving cyclic games
- Gray Code for Cayley Permutations
- Quasi-stability of a vector trajectorial problem with non-linear partial criteria
- Finite fields and cryptology
- Mobile Communications World: Security Implementations Aspects - A State of the Art
- Combined Randomized-Local Hough Transform versus UpWrite Transform in stamp detection
- Lower Bounds and Semi On-line Multiprocessor Scheduling
