On the number of words of $N=3 \,n$ letters with a three-letter alphabet
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914256723640320 |
|---|---|
| author | Serra, Pablo |
| author_facet | Serra, Pablo |
| contents | In this paper we address the well-known problem of counting the number of $3n$-letter words that can be formed from a three-letter alphabet by decomposing it into four possible cases based on its remainder when divided by three. The solution to the problem also gives us some sums of trinomial coefficients. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_22362 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the number of words of $N=3 \,n$ letters with a three-letter alphabet Serra, Pablo Combinatorics In this paper we address the well-known problem of counting the number of $3n$-letter words that can be formed from a three-letter alphabet by decomposing it into four possible cases based on its remainder when divided by three. The solution to the problem also gives us some sums of trinomial coefficients. |
| title | On the number of words of $N=3 \,n$ letters with a three-letter alphabet |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2512.22362 |