Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with combinatorics-on-words
Search options not deleted
user 6634
A branch of combinatorics that focuses on the study of words and formal languages
2
votes
Accepted
Number and asymptotic for cyclic sequences
You are essentially counting necklaces, see e.g. http://theory.cs.uvic.ca/inf/neck/NecklaceInfo.html. The number of necklaces of length $l$ over a $k$-element alphabet is
$N_k(l)=\frac{1}{l}\sum_{d|l …
- 378