MathGroup Archive 1999

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

Search the Archive

Re: Enumerating Permutations

  • To: mathgroup at
  • Subject: [mg20061] Re: [mg20006] Enumerating Permutations
  • From: Ken Levasseur <Kenneth_Levasseur at>
  • Date: Wed, 29 Sep 1999 03:33:23 -0400
  • Organization: UMass Lowell Mathematical Sciences
  • References: <>
  • Sender: owner-wri-mathgroup at


There is a book titled "Enumerative Combinatorics" - the author's last
name is Stanley
 - that has algorithms for enumerating all kinds of objects, including
the one you need. I have a copy in my office, so if you need more
details I can get them for you tomorrow.

Ken Levasseur
UMass Lowell

Vic Fanberg wrote:
> I am looking for an algorithm for determining the Nth permutation (P) of a
> group T.  I don't really care the ordering of the permutations within T, as
> long as all the permutations of P are members of T exactly once.  (Each
> element of the permutation P is unique.)
> Actually, each of the permutations are only 7 digits long and I could list
> all 5040 permutations in a file about 35K, but I was hoping for something a
> little cleaner, in case I change to 8 or 9 digits long later.
> Does anyone know of such an algorithm?
> Sorry I don't have the math background to phrase the question any better.
> But I would very much appreciate any help or references you can point me to.
> Vic

  • Prev by Date: Re: Contourline values
  • Next by Date: Re: Plot3D Problem with Nonreal Numbers
  • Previous by thread: Enumerating Permutations
  • Next by thread: Re: Enumerating Permutations