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

形式Zeta函数展开与Ramanujan图的频率

Formal Zeta Function Expansions and the Frequency of Ramanujan Graphs

Joel Friedman

摘要:

我们证明了任何正则图的Zeta函数的对数导数都是由关于无穷大的幂级数给出的,其系数是由图的桥本矩阵的幂的迹给出的。然后我们考虑这个幂级数的期望值随机,$d$ -正则图上的$n$顶点,其中$d$固定和$n$趋于无穷大。在相当投机的假设下,我们进行了正式的计算,表明对于固定的$d$和$n$大,这个期望值应该有简单的极点残留$-1/2$在$\pm (d-1)^{-1/2}$。我们将解释,计算表明,对于固定的$d$,存在一个$f(d)>1/2$,使得$n$顶点上的$d$正则图是Ramanujan,对于足够大的$n$,概率至少为$f(d)$。我们的形式计算有一个自然的模拟,当我们考虑随机覆盖图的程度$n$在一个固定的,定期的“基图。“这再次表明,对于$n$大,严格大多数随机覆盖图相对Ramanujan。我们不认为我们的正式计算提供了压倒性的证据,关于频率的拉马努金图。然而,这些计算是相当简单的,并产生有趣的建议,我们认为值得进一步研究。

英文摘要:

We show that logarithmic derivative of the Zeta function of any regular graph is given by a power series about infinity whose coefficients are given in terms of the traces of powers of the graph's Hashimoto matrix. We then consider the expected value of this power series over random, $d$-regular graph on $n$ vertices, with $d$ fixed and $n$ tending to infinity. Under rather speculative assumptions, we make a formal calculation that suggests that for fixed $d$ and $n$ large, this expected value should have simple poles of residue $-1/2$ at $\pm (d-1)^{-1/2}$. We shall explain that calculation suggests that for fixed $d$ there is an $f(d)>1/2$ such that a $d$-regular graph on $n$ vertices is Ramanujan with probability at least $f(d)$ for $n$ sufficiently large. Our formal computation has a natural analogue when we consider random covering graphs of degree $n$ over a fixed, regular "base graph." This again suggests that for $n$ large, a strict majority of random covering graphs are relatively Ramanujan. We do not regard our formal calculations as providing overwhelming evidence regarding the frequency of Ramanujan graphs. However, these calculations are quite simple, and yield intiguing suggestions which we feel merit further study.

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

↑