Re: ListNecklaces of n beads of |c| different colors (n!=c)?
- To: mathgroup at smc.vnet.net
- Subject: [mg42045] Re: ListNecklaces of n beads of |c| different colors (n!=c)?
- From: "Steve Luttrell" <luttrell at _removemefirst_westmal.demon.co.uk>
- Date: Tue, 17 Jun 2003 05:43:31 -0400 (EDT)
- References: <bcjuvb$htp$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Have a look at the documentation (Help Browser) for DiscreteMath`Combinatorica`. The pragraph starting "The classic problem in Polya theory is counting how many different ways necklaces can be made out of a beads, when there are a different types or colors of beads to choose from" looks just like what you are looking for. -- Steve Luttrell West Malvern, UK "maneesh" <maneesh at drunkenbastards.com> wrote in message news:bcjuvb$htp$1 at smc.vnet.net... > Hi all, > Is there anyway I can obtain a list of necklaces of n beads of |c| > different colors? > > I can certainly count the number of them, but I can't figure out how > to construct them in Mathematica... > > I shamefully admit to not understanding why Length[c] has to be equal > to n for ListNecklaces to work.... >