arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.05705cs.DMmath.CO
收藏

关于相对化Alon特征值猜想II:游动的渐近展开定理

On the Relativized Alon Eigenvalue Conjecture II: Asymptotic Expansion Theorems for Walks

Joel Friedman, David Kohler

摘要:

这是第二次在一系列的文章致力于表明,一个典型的覆盖地图的大程度上一个固定的,经常图有其新的邻接特征值范围内的阿隆所确定的随机定期图。本文的第一个主要结果涉及函数$f(k,n)$,定义为在固定图的度为$n$的随机覆盖图中,给定同伦类型的长度为$k$的SNBC(严格非回溯闭)行走的数目.我们证明了存在的渐近展开的权力的$1/n$为$f(k,n)$,其中的系数-功能的$k$ --被证明有一些理想的性质,即,这些系数是近似的总和多项式倍指数函数。第二个主要结果是第一个的推广,其中长度为$k$的SNBC行走的数量乘以覆盖图包含某种类型的{ \em tangle}的指示函数;第二个结果需要更多的术语,尽管其证明使用了用于证明第一个结果的相同的基本工具。第二个主要结果的动机将在本系列文章的第三篇文章中清楚地说明。本文中的结果大多是以前作品中使用的方法的简单概括。然而,本文(1)将这些方法“分解”为一些简短的,概念上简单的,独立的部分,(2)用更一般的术语编写每个独立的部分,(3)显着简化了以前的计算之一。因此,我们希望本文能够更容易地将跟踪方法应用于随机图的相关模型。

英文摘要:

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first main result in this article concerns the function $f(k,n)$ defined as the number of SNBC (strictly non-backtracking closed) walks of length $k$ of a given homotopy type in a random covering graph of degree $n$ of a fixed graph. We prove the existence of asymptotic expansions in powers of $1/n$ for $f(k,n)$, where the coefficients---functions of $k$---are proven to have some desirable properties; namely, these coefficients are approximately a sum of polynomials times exponential functions. The second main result is a generalization of the first, where the number of SNBC walks of length $k$ is multiplied by an indicator function that the covering graph contains a certain type of {\em tangle}; the second result requires more terminology, although its proof uses the same basic tools used to prove the first result. % The motivation for the second main result will be clear in % the third article in this series of articles. The results in this article are mostly straightforward generalizations of methods used in previous works. However, this article (1) "factors" these methods into a number of short, conceptually simple, and independent parts, (2) writes each independent part in more general terms, and (3) significantly simplifies of one of the previous computations. As such we expect that this article will make it easier to apply trace methods to related models of random graphs.

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

↑