An isoperimetric inequality for word overlap
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911483015725056 |
|---|---|
| author | Zakharov, Dmitrii |
| author_facet | Zakharov, Dmitrii |
| contents | Let $A$ and $B$ be sets of words of length $n$ over some finite alphabet. Suppose that no suffix of a word in $A$ coincides with a prefix of a word in $B$. Then we show that the product of densities of $A$ and $B$ is upper bounded by $(1+o(1))/(en)$. This bound is asymptotically sharp. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_20143 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An isoperimetric inequality for word overlap Zakharov, Dmitrii Combinatorics Let $A$ and $B$ be sets of words of length $n$ over some finite alphabet. Suppose that no suffix of a word in $A$ coincides with a prefix of a word in $B$. Then we show that the product of densities of $A$ and $B$ is upper bounded by $(1+o(1))/(en)$. This bound is asymptotically sharp. |
| title | An isoperimetric inequality for word overlap |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2602.20143 |