On the Pólya Enumeration Theorem

Details On the Pólya Enumeration Theorem On the Pólya Enumeration Theorem

2005-08-25

arxiv.org/abs/math/0508512v1

Mathematics

Combinatorics

3 pages

Scientific paper

Simple formulas for the number of different cyclic and dihedral necklaces
containing $n_j$ beads of the $j$-th color, $j\leq m$ and $\sum_{j=1}^mn_j=N$,
are derived.

Affiliated with

Also associated with

No associations

Rating

On the Pólya Enumeration Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Pólya Enumeration Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Pólya Enumeration Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263301