TY - RPRT
T1 - Zur LĂ¶sung des Halskettenproblems
A1 - Rauscher,Reinhard
A1 - Lang,Rainer
Y1 - 2009/08/26
N2 - The work presented concerns the following question: Let be given an amount of beads with different colors. The question is, how much different necklaces could be constructed from them. Necklaces, which could be transformed by rotation and/or mirroring in each other, are considered to be identical. E.g., the problem [2,2,4] describes the following: Given are 2 beads of color a, 2 beads of color b, and 4 beads of color c. How much different necklaces of length 8 could be constructed ? Within the paper the needed formula for the exact solution have been derived and proven. Additionally, there exists a software package, which calculates the exact solution for problems with at most 999 beads up to 14 different colors.
KW - Diskrete Mathematik
CY - Hamburg
PB -
AD -
L2 - http://edoc.sub.uni-hamburg.de/informatik/volltexte/2009/47
ER -