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

具有非固定跳的循环图的复杂性、算术性质和渐近性

Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics

Alexander Mednykh, Ilya Mednykh

摘要:

本文研究了一类具有非固定跳数的循环图$$G_n=C_{βn}(s_1, \ldots,s_k,α_1n,\ldots,α_\ell n),\, 1\le s_1<\ldots<s_k\le[\frac{βn}{2}],\, 1\le α_1< \ldots<α_\ell\le[\fracβ{2}].$$.这里$n$是一个任意大的自然数,整数$s_1, \ldots,s_k,α_1, \ldots,α_\ell$假定是固定的.首先,我们提出了一个显式的公式,在图$G_n.$的生成树的数量这个公式是一个产品的$βs_k-1$因素,每个给定的$n$ -th Chebyshev多项式的第一类评估的一些规定的多项式的次数$s_k.$的根接下来,我们提供了一些算术性质的复杂性函数。本文证明了$G_n$中生成树的个数可以用$τ(n)=p \,n \,a(n)^2,$的形式表示,其中$a(n)$是一个整数序列,$p$是一个依赖于$β$和$n.$的奇偶性的自然数。最后,我们通过与$2k-\sum\limits_{i=1}^k(z^{s_i}+z^{-s_i}).$相差一个常数的Laurent多项式的Mahler测度,得到了$τ(n)$的一个渐近公式

英文摘要:

In the present paper, we investigate a family of circulant graphs with non-fixed jumps $$G_n=C_{βn}(s_1, \ldots,s_k,α_1n,\ldots,α_\ell n),\, 1\le s_1<\ldots<s_k\le[\frac{βn}{2}],\, 1\le α_1< \ldots<α_\ell\le[\fracβ{2}].$$ Here $n$ is an arbitrary large natural number and integers $s_1, \ldots,s_k,α_1, \ldots,α_\ell$ are supposed to be fixed. First, we present an explicit formula for the number of spanning trees in the graph $G_n.$ This formula is a product of $βs_k-1$ factors, each given by the $n$-th Chebyshev polynomial of the first kind evaluated at the roots of some prescribed polynomial of degree $s_k.$ Next, we provide some arithmetic properties of the complexity function. We show that the number of spanning trees in $G_n$ can be represented in the form $τ(n)=p \,n \,a(n)^2,$ where $a(n)$ is an integer sequence and $p$ is a prescribed natural number depending of parity of $β$ and $n.$ Finally, we find an asymptotic formula for $τ(n)$ through the Mahler measure of the Laurent polynomials differing by a constant from $2k-\sum\limits_{i=1}^k(z^{s_i}+z^{-s_i}).$

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

↑