Bill Allombert on Sat, 09 Jun 2007 22:45:45 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: 'necklace'-type classes of combinatorial compositions

On Sat, Jun 09, 2007 at 01:10:01PM -0700, john n wrote:
> Hello, I am a PARI-GP newbie and wondered whether someone might help me with
> code for listing the classes of combinatorial compositions of p which
> contain q elements, and which are equivalent under reflection or cycling.
> These are closely related to "necklaces".
> Each equivalence class can be denoted by its lexicographically first
> element, e.g. when p=10 and q=3,
> {{1,2,6},{2,6,1},{6,1,2},{6,2,1},{2,1,6},{1,6,2}} can be denoted by {1,2,6}. 

1+2+6=9. Should not that be equal to p ?