MathGroup Archive 2003

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

Search the Archive

Re: ListNecklaces of n beads of |c| different colors (n!=c)?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg42054] Re: ListNecklaces of n beads of |c| different colors (n!=c)?
  • From: Bruce Atwood <bta at attewode.com>
  • Date: Tue, 17 Jun 2003 05:43:55 -0400 (EDT)
  • Organization: TDS.NET Internet Services www.tds.net
  • References: <bcjuvb$htp$1@smc.vnet.net>
  • Reply-to: bta at attewode.com
  • Sender: owner-wri-mathgroup at wolfram.com

Maneesh,

This might be more than you want to know, but for a systematic approach 
to your problem look up Burnside's Theorem in a Combinatorics text or 
Abstract Algebra text. For example, Contemporary Abstract Algebra by 
Gallian or Introductory Combinatorics by Brualdi.

I hope this helps.
Bruce Atwood

maneesh wrote:

>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....
>
>  
>


  • Prev by Date: Re: Averaging
  • Next by Date: Re: System of ODE
  • Previous by thread: ListNecklaces of n beads of |c| different colors (n!=c)?
  • Next by thread: Re: ListNecklaces of n beads of |c| different colors (n!=c)?