关于含有$p^2$字母的某些语言的密度
On the density of certain languages with $p^2$ letters
摘要:
由规则$x_n=(2^n+1)(2^{n-1}+1)/3$给出的序列$(x_n)_{n\in\mathbb N} = (2,5,15,51,187,\dots)$出现在几个看似无关的数学领域。例如,$x_n$是长度为$n$且具有四个不同字母的单词的语言密度。它也是$(\mathbb Z_2\times \mathbb Z_2)^n$在特殊线性群$\mathrm{SL}(2,\mathbb Z)$的左作用下的商的基数。在本文中,我们将展示这两种解释的$x_n$是相互关联的。更一般地说,对于素数$p$,我们展示了$(\mathbb Z_p\times\mathbb Z_p)^n$的商与具有$p^2$字母和长度为$n$的单词的语言之间的对应关系。
英文摘要:
The sequence $(x_n)_{n\in\mathbb N} = (2,5,15,51,187,\dots)$ given by the rule $x_n=(2^n+1)(2^{n-1}+1)/3$ appears in several seemingly unrelated areas of mathematics. For example, $x_n$ is the density of a language of words of length $n$ with four different letters. It is also the cardinality of the quotient of $(\mathbb Z_2\times \mathbb Z_2)^n$ under the left action of the special linear group $\mathrm{SL}(2,\mathbb Z)$. In this paper we show how these two interpretations of $x_n$ are related to each other. More generally, for prime numbers $p$ we show a correspondence between a quotient of $(\mathbb Z_p\times\mathbb Z_p)^n$ and a language with $p^2$ letters and words of length $n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。