Skip to content


Here are 18 public repositories matching this topic...

Permutations can be considered as the orbits of a dynamic system p' = succ(p), where p is a permutation and p' is its successor in the lexycographically ordered set of permutations (plus the Nil permutation, whose successor is Nil). Here I present a function that produces those orbits as well as a number of "permutation numbers" derived from those orbits.

  • Updated May 29, 2018
  • CWeb

Improve this page

Add a description, image, and links to the dynamic-systems topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the dynamic-systems topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.