MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

General--Simple Permutations

  • To: mathgroup at
  • Subject: [mg70333] General--Simple Permutations
  • From: andrew.and.liz at
  • Date: Fri, 13 Oct 2006 01:30:36 -0400 (EDT)

I would like to write a function that can look at a long list of permutations (an output from other calculations) and list, in cycle form, only the permutations that consist of 2 cycles or 3 cycles and leave the rest of the places alone. I am analyzing a permutation puzzle and am looking for short sequences of moves that switch a few places and leave the rest of the pieces in place. Any help would be appreciated! 

Link to the forum page for this post:
Posted through [[postId=14360]]

  • Prev by Date: Re: Is it possible to "pre-evaluate" parts of pure function?
  • Next by Date: Re: sample programs
  • Previous by thread: Re: How to extract numbers from list elements with text?
  • Next by thread: Re: General--Simple Permutations