无边界部分词与稀疏尺之间的联系
A Connection Between Unbordered Partial Words and Sparse Rulers
AI总结:
本文通过建立无边界部分词与稀疏尺之间的联系,改进了字母表大小至少为4时无边界部分词最大洞数的界,并给出二维二元情形的正确渐近及一个反例。
摘要:
部分词是指除字母外还包含称为“洞”的特殊符号$\u25c7$的词。两个部分词$a=a_0 \dots a_n$和$b=b_0 \dots b_n$是兼容的,如果对所有$i$,$a_i = b_i$或$a_i, b_i$中至少有一个是洞。一个部分词是无边界的,如果它不存在非空真前缀与后缀兼容。否则该部分词是有边界的。集合$R \subseteq \{0, \dots, n\}$被称为长度为$n$的完全稀疏尺,如果对所有$k \in \{0, \dots, n\}$存在$r, s \in R$使得$k = r - s$。这些也被称为受限差基。从定义可知,部分词中的洞越多,它越可能是有边界的。通过引入无边界部分词与稀疏尺之间的联系,我们改进了在大小为4或更大的字母表上无边界部分词所能具有的最大洞数的界。我们还为一个先前报道的定理提供了反例。随后我们研究了这些结果的二维推广。我们采用一维情形的方法来求解无边界二维二元部分词所能具有的洞数的正确渐近。这一推广可能引发进一步的研究问题。
英文摘要:
$\textit{Partial words}$ are words that contain, in addition to letters, special symbols $\diamondsuit$ called $\textit{holes}$. Two partial words of $a=a_0 \dots a_n$ and $b=b_0 \dots b_n$ are $\textit{compatible}$ if for all $i$, $a_i = b_i$ or at least one of $a_i, b_i$ is a hole. A partial word is $\textit{unbordered}$ if it does not have a nonempty proper prefix and a suffix that are compatible. Otherwise the partial word is $\textit{bordered}$. A set $R \subseteq \{0, \dots, n\}$ is called a $\textit{complete sparse ruler of length $n$}$ if for all $k \in \{0, \dots, n\}$ there exists $r, s \in R$ such that $k = r - s$. These are also known as $\textit{restricted difference bases}$. From the definitions it follows that the more holes a partial word has, the more likely it is to be bordered. By introducing a connection between unbordered partial words and sparse rulers, we improve bounds on the maximum number of holes an unbordered partial word can have over alphabets of sizes $4$ or greater. We also provide a counterexample for a previously reported theorem. We then study a two-dimensional generalization of these results. We adapt methods from one-dimensional case to solve the correct asymptotic for the number of holes an unbordered two-dimensional binary partial word can have. This generalization might invoke further research questions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。