Hostname: page-component-7c8c6479df-ph5wq Total loading time: 0 Render date: 2024-03-28T22:33:25.862Z Has data issue: false hasContentIssue false

COUNTING SYMMETRIC COLOURINGS OF THE VERTICES OF A REGULAR POLYGON

Published online by Cambridge University Press:  10 January 2014

YEVHEN ZELENYUK*
Affiliation:
School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits 2050, Johannesburg, South Africa email yuliya.zelenyuk@wits.ac.za
YULIYA ZELENYUK
Affiliation:
School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits 2050, Johannesburg, South Africa email yuliya.zelenyuk@wits.ac.za
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.

A colouring of the vertices of a regular polygon is symmetric if it is invariant under some reflection of the polygon. We count the number of symmetric $r$-colourings of the vertices of a regular $n$-gon.

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

References

Aigner, M., Combinatorial Theory (Springer, Berlin, 1979).CrossRefGoogle 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 colorings of regular polygons’, Ars Combinatorica 78 (2006), 277281.Google Scholar
Vinogradov, I., Elements of Number Theory (Dover Publications, Mineola, NY, 1954).Google Scholar
Zelenyuk, Y. and Zelenyuk, Yu., ‘Counting symmetric bracelets’, Bull. Aust. Math. Soc., to appear. Published online 22 August 2013.Google Scholar