7899
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Gray Indexed Minimum Change Permutation
In a minimum change enumeration of permutations, all neighboring permutations differ by exactly one transposition of two elements. Minimum change permutations can be constructed from Gray coded mixed base indices.
Contributed by:
Michael Schreiber
SNAPSHOTS
RELATED LINKS
Permutation
(
Wolfram
MathWorld
)
Gray Code
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Gray Indexed Minimum Change Permutation
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/GrayIndexedMinimumChangePermutation/
Contributed by:
Michael Schreiber
Share:
Embed Interactive Demonstration
New!
Download Demonstration as CDF »
Download Source Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
The Cantor Sequence with Bits
Michael Schreiber
Mixed Base Gray Codes
Michael Schreiber
Binary Gray Code
Michael Schreiber
Elementary Cellular Automaton Rules by Gray Code
Michael Schreiber
Look and Say Sequence Steps
Michael Schreiber
De Bruijn Graph Arcs
Michael Schreiber
Gray Code's Error Reduction with Encoders
Mark Peterson
Self-Delimiting Binary Representation of a Ternary List
Michael Schreiber
Fibonacci Mountain Matra Meru
Michael Schreiber
Permuted Projections of Nested Arrays
Michael Schreiber
Related Topics
Algorithms
Combinatorics
Discrete Mathematics
Integers
Representations of Numbers
Browse all topics
Contribute
Make a new version of this Demonstration
Upload a new Demonstration
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+