Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-23T15:04:59.330Z Has data issue: false hasContentIssue false

COUNTING SYMMETRIC BRACELETS

Published online by Cambridge University Press:  22 August 2013

YEVHEN ZELENYUK*
Affiliation:
School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits, 2050, Johannesburg, South Africa email [email protected]
YULIYA ZELENYUK
Affiliation:
School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits, 2050, Johannesburg, South Africa email [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

An $r$-ary necklace (bracelet) of length $n$ is an equivalence class of $r$-colourings of vertices of a regular $n$-gon, taking all rotations (rotations and reflections) as equivalent. A necklace (bracelet) is symmetric if a corresponding colouring is invariant under some reflection. We show that the number of symmetric $r$-ary necklaces (bracelets) of length $n$ is $\frac{1}{2} (r+ 1){r}^{n/ 2} $ if $n$ is even, and ${r}^{(n+ 1)/ 2} $ if $n$ is odd.

Type
Research Article
Copyright
Copyright ©2013 Australian Mathematical Publishing Association Inc. 

References

Aigner, M., Combinatorial Theory (Springer, Berlin–Heidelberg–New York, 1979).Google Scholar
Bender, E. and Goldman, J., ‘On the applications of Möbius inversion in combinatorial analysis’, Amer. Math. Monthly 82 (1975), 789803.Google Scholar
Gryshko, Y., ‘Symmetric colourings of regular polygons’, Ars Combin. 78 (2006), 277281.Google Scholar
Gryshko, Y. and Protasov, I., ‘Symmetric colourings of finite Abelian groups’, Dopov. Akad. Nauk Ukr. (2000), 3233.Google Scholar