No CrossRef data available.
Article contents
ENUMERATING NECKLACES WITH TRANSITIONS
Published online by Cambridge University Press: 11 May 2021
Abstract
Necklaces are the equivalence classes of words under the action of the cyclic group. Let a transition in a word be any change between two adjacent letters modulo the word’s length. We present a closed-form solution for the enumeration of necklaces in n beads, k colours and t transitions. We show that our result provides a more general solution to the problem of counting alternating (proper) colourings of the vertices of a regular n-gon.
MSC classification
- Type
- Research Article
- Information
- Copyright
- © 2021 Australian Mathematical Publishing Association Inc.
Footnotes
Partially supported by the Department of Engineering, Università degli Studi di Perugia, Italy, within the project Artificial Intelligence for Earth Observation (Fundamental Research Grant Scheme 2020).
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230103145337780-0815:S0004972721000307:S0004972721000307_inline1.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230103145337780-0815:S0004972721000307:S0004972721000307_inline2.png?pub-status=live)