Ihara zeta function, coefficients of Maclaurin series, and Ramanujan graphs
Abstract
Let X denote a connected (q+1)-regular undirected graph of finite order n. The graph X is called Ramanujan whenever |λ|≤ 2q12 for all nontrivial eigenvalues λ of X. We consider the variant (u) of the Ihara zeta function Z(u) of X defined by gather* (u)-1 = \ arrayll (1-u)(1-qu)(1-q12 u)2n-2(1-u2)n(q-1)2 Z(u) &if X is nonbipartite, (1-q2u2) (1-q12 u)2n-4 (1-u2)n(q-1)2+1 Z(u) &if X is bipartite. array . gather* The function (u) satisfies the functional equation (q-1 u-1)=(u). Let \hk\k=1∞ denote the number sequence given by ddu (q-12u) =Σk=0∞ hk+1 uk. In this paper we establish the equivalence of the following statements: (i) X is Ramanujan; (ii) hk≥ 0 for all k≥ 1; (iii) hk≥ 0 for infinitely many even k≥ 2. Furthermore we derive the Hasse--Weil bound for the Ramanujan graphs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.