arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.20143math.CO
收藏

关于词重叠的等周不等式

An isoperimetric inequality for word overlap

Massachusetts Institute of Technology(麻省理工学院)

Dmitrii Zakharov

AI总结:

该研究证明了在词集$A$和$B$中不存在词后缀与前缀重叠的情况下,两者的密度乘积的渐近上界为$(1+o(1))/(en)$。

摘要:

设$A$和$B$是某个有限字母表上长度为$n$的词集。假设$A$中词的后缀不与$B$中词的前缀相同。然后我们证明$A$和$B$的密度乘积被上界限制为$(1+o(1))/(en)$。这个界是渐近最优的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑