arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2404.07285math.COmath.PR
收藏

青蛙、帽子与公共子序列

Frogs, hats and common subsequences

Joseph Briggs, Alex Parker, Coy Schwieder, Chris Wells

AI总结:

该研究延续Bukh和Cox的青蛙动力学相关工作,针对单词$12\cdots kk\cdots 21$的重复序列与随机序列的最长公共子序列长度常数,推导得到显式公式,并引出新的组合对象“戴帽子的青蛙”。

摘要:

记$W^{(n)}$为将固定单词$W$重复得到的$n$字母单词,令$R_n$表示从与$W$相同的字母表中采样的均匀随机$n$字母单词。我们关注$W^{(n)}$与$R_n$之间最长公共子序列的平均长度,已知其形式为$γ(W)·n+o(n)$,其中$γ(W)$为某个常数。Bukh和Cox近期提出了一种被称为frog dynamics(青蛙动力学)的相互作用粒子系统,可用于计算任意固定单词$W$对应的常数$γ(W)$。他们成功分析了青蛙动力学的最简单情形,得到了常数$γ(12\cdots k)$的显式公式。我们延续这项研究,利用青蛙动力学推导出常数$γ(12\cdots kk\cdots 21)$的显式公式。该情形下的青蛙动力学是环上PushTASEP的一种变体,其中部分时钟是相同的。有意思的是,这类带相关时钟的排斥过程此前似乎尚未被研究过。我们的分析引出了一个看似全新的、可能具有独立研究价值的组合对象:frogs with hats(戴帽子的青蛙)!

英文摘要:

Write $W^{(n)}$ to mean the $n$-letter word obtained by repeating a fixed word $W$ and let $R_n$ denote a uniformly random $n$-letter word sampled from the same alphabet as $W$. We are interested in the average length of the longest common subsequence between $W^{(n)}$ and $R_n$, which is known to be $γ(W)\cdot n+o(n)$ for some constant $γ(W)$. Bukh and Cox recently developed an interacting particle system, dubbed the frog dynamics, which can be used to compute the constant $γ(W)$ for any fixed word $W$. They successfully analyzed the simplest case of the frog dynamics to find an explicit formula for the constants $γ(12\cdots k)$. We continue this study by using the frog dynamics to find an explicit formula for the constants $γ(12\cdots kk\cdots 21)$. The frog dynamics in this case is a variation of the PushTASEP on the ring where some clocks are identical. Interestingly, exclusion processes with correlated clocks of this type appear to have not been analyzed before. Our analysis leads to a seemingly new combinatorial object which could be of independent interest: frogs with hats!

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

↑