Questions tagged [necklace-and-bracelets]

In combinatorics, a necklace of length $n$ is an equivalence class of strings of length $n$, under rotation, so $abcde = bcdea$. A bracelet is an equivalence class of strings under rotation and reflection (so in addition $abcde = edcba$).

Given a set $A$ which we call the alphabet, the set of length $n$ strings are the ordered tuples $A^n$ which we can interpret as the set of all mappings $\{0,1,2,\ldots,n-1\} \to A$.

Let $S_n$ be the symmetric group of order $n$, it acts naturally on $\{0,1,2,\ldots,n-1\}$, which induces an action on $A^n$. Two particular subgroups can be distinguished: the cyclic group $C_n$, which is generated by $i \mapsto i +1 \pmod n$, and the dihedral group $D_n$, which has the additional generator $i \mapsto n -1 - i$.

The orbits of $C_n$ in $A^n$ are called necklaces. They are the equivalence class of strings where two strings are equivalent if one can cyclically rotate one to the other. For example:

$$ abcde \mapsto bcdea \mapsto cdeab \mapsto deabc \mapsto eabcd\mapsto abcde $$

shows the orbit of the string $abcde$ under the action $C_n$. These strings are all regarded as the same necklace.

The orbits of $D_n$ in $A^n$ are called bracelets. In addition to the cyclic rotations, we also identify two strings if they are mirror images

$$ abcde \leftrightarrow edcba.$$

See Wikipedia.

93 questions
11
votes
1 answer

Coloring $n$ chain with $k$ colors

Chains are made from beads, each in one of $k$ colors. In each chain there is $n$ beads. We claim that two chains are the same if one can be made from second by cyclic rotation (mirror reflection is not allowed there). How many different chains can…
9
votes
3 answers

Primitive binary necklaces

The problem/solution of counting the number of (primitive) necklaces (Lyndon words) is very well known. But what about results giving sufficient conditions for a given necklace be primitive? For example, in the binary case, a necklace of length $N$…
8
votes
2 answers

Does every sufficiently long string contain consecutive permutations of another string?

Let $\mathcal{C}$ be a finite set, let $\mathcal{F}(\mathcal{C})$ be the free (non-abelian) monoid over $\mathcal{C}$, and let $n\in\mathbb{N}$ be an integer. For every $k\in \mathbb{N}$, write $S_k$ for the full symmetric group of degree $k$.…
7
votes
1 answer

Intuition Behind Necklace Formula

Wikipedia and Wolfram MathWorld say that the formula for the number of distinct $k$-ary necklaces of length $n$ is: $$ N_k(n) = \frac{1}{n}\sum_{d|n} {\phi(d)k^{n/d}} $$ What is the intuition behind this formula?
6
votes
2 answers

Number of ways to arrange objects in a circle, some of which may be identical

I know that the number of ways to arrange $n$ distinct objects in a circle in $(n-1)!$ from Circular Permutation. But suppose we have $n_1$ identical objects of Type $1$, $n_2$ identical objects of Type $2$ and so on upto $n_k$ identical objects of…
6
votes
1 answer

Counting necklace with no adjacent beads are of the same color

I've read that one can use the Polya enumeration theorem or the Burnside's lemma to count the number of necklaces using $n$ beads from $k$ colors. Can we then find a way to count the number of necklaces such that no adjacent beads are of the same…
6
votes
2 answers

Inequality involving number of binary Lyndon words of length $n$ and $n+1$

Let $f(n)$ be the number of binary Lyndon words of length $n$. This sequence is given by OEIS entry A001037. Is it true that $2f(n) \ge f(n+1)$ for all positive $n$? I have found a general formula to calculate $f(n)$: $$ f(n) = \frac{1}{n}…
5
votes
0 answers

Bijection between unimodal cyclic permutations and primitive binary necklaces where complements are equivalent

I recently realized that the number of unimodal cyclic permutations of ${1,2,\dots,n}$ matched the number of primitive binary necklaces where complements are considered equivalent, given by the formula $$\frac{1}{2n}\sum_{d \mid n, d\text{…
5
votes
1 answer

Using burnside's lemma to calculate a smaller subset of unique, color-agnostic bracelets

We have a child's toy, which is a ball made of 12 colored wedges (3 Red, 3 Green, 3 Blue, 3 Yellow). Our child asked the sensible question 'how many different patterns are possible?'. In researching the answer, I discovered it's a mathematically…
Granny
  • 53
5
votes
0 answers

Necklace infinte sum

Consider the function: $$S(n)=\sum_{j=1}^{\infty}\frac{j^n}{2^j}=\frac1 2+\frac{2^n}{4}+\frac{3^n}{8}+\frac{4^n}{16}+\frac{5^n}{32}+...$$ Euler found the sum of the first few of these as: $S(0)=1$; (as per the usual geometric series.) $S(1)=2$; etc.…
5
votes
1 answer

Counting Necklaces

Suppose we have a necklace with $n$ beads. Each bead is either red or blue. I'd like to ask how to count the number of necklaces $f(n,m,k)$ satisfying the following requirements: 1) There are exactly $m$ red beads; $(0 \leq m \leq n)$. 2) No two…
5
votes
1 answer

Number of Necklaces of Beads in Two Colors

I was reading this paper, and came across an equation which gives an expression for the number of necklaces of beads in two colors, with length n. $Z_n = \dfrac{1}{n} \displaystyle \sum \limits_{d \mid n} \phi \left( d \right) 2^{n/d}$ The author…
Ryan
  • 1,419
4
votes
2 answers

How many necklaces can be formed with $6$ identical diamonds and $3$ identical pearls

Find number of ways to make a necklace (or a garland) consisting of $6$ identical diamonds and $3$ identical pearls. I got the correct answer $7$ by taking different cases but when I applied the formula for arrangement, i.e.…
4
votes
1 answer

How many necklaces with given certain colored beads

I am interested to know if there's a way to calculate the number of (rotation agnostic) necklaces that can be produced from different colored beads, each color with its own quantity. For instance, if I have a 3 red beads, 2 green beads and 1 blue…
4
votes
1 answer

Finding "beautiful" necklaces with regular gaps

I am looking for "beautiful" arrangements of $k$-ary necklaces of length $ak$ where each of the $k$ types of bead appears $a$ times ($a \geq 1$ a natural number). A necklace is considered beautiful if the sequence of gap lengths for all $k$ types of…
badroit
  • 826
1
2 3 4 5 6 7