Ihara zeta function, coefficients of Maclaurin series, and Ramanujan graphs
Hau-Wen Huang

TL;DR
This paper explores the relationship between Ramanujan graphs, Ihara zeta functions, and Maclaurin series coefficients, establishing equivalences and bounds that deepen understanding of spectral properties of these graphs.
Contribution
It introduces a new characterization of Ramanujan graphs via the positivity of coefficients in a Maclaurin series expansion of a zeta function variant.
Findings
Equivalence between Ramanujan property and positivity of series coefficients.
Derived Hasse–Weil bound for Ramanujan graphs.
Established functional equation for the zeta function variant.
Abstract
Let denote a connected -regular undirected graph of finite order . The graph is called Ramanujan whenever for all nontrivial eigenvalues of . We consider the variant of the Ihara zeta function of defined by \begin{gather*} \Xi(u)^{-1} = \left\{ \begin{array}{ll} (1-u)(1-qu)(1-q^{\frac{1}{2}} u)^{2n-2}(1-u^2)^{\frac{n(q-1)}{2}} Z(u) \qquad &\hbox{if is nonbipartite}, (1-q^2u^2) (1-q^{\frac{1}{2}} u)^{2n-4} (1-u^2)^{\frac{n(q-1)}{2}+1} Z(u) \qquad &\hbox{if is bipartite}. \end{array} \right. \end{gather*} The function satisfies the functional equation . Let denote the number sequence given by In this paper we establish the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Algebra and Geometry · Synthesis and Properties of Aromatic Compounds
Ihara zeta function, coefficients of Maclaurin series, and Ramanujan graphs
Hau-Wen Huang
Department of Mathematics
National Central University
Chung-Li 32001 Taiwan
Abstract.
Let denote a connected -regular undirected graph of finite order . The graph is called Ramanujan whenever
[TABLE]
for all nontrivial eigenvalues of . We consider the variant of the Ihara zeta function of defined by
[TABLE]
The function satisfies the functional equation . Let denote the number sequence given by
[TABLE]
In this paper we establish the equivalence of the following statements: (i) is Ramanujan; (ii) for all ; (iii) for infinitely many even . Furthermore we derive the Hasse–Weil bound for the Ramanujan graphs.
Keywords: Hasse–Weil bound, Ihara zeta function, Li’s criterion, Ramanujan graphs.
MSC2020: 05C50, 11M26.
1. Introduction
The motivation of this paper originates from developing a graph theoretical counterpart of the following sufficient and necessary condition for the Riemann hypothesis. Recall that the Riemann zeta function is the analytic continuation of
[TABLE]
The negative even integers are trivial zeros of and the Riemann hypothesis asserts that the real part of every nontrivial zero of is . The Riemann xi function is a variation of defined by
[TABLE]
where is the Gamma function. The function satisfies the functional equation
[TABLE]
Let denote the number sequence given by
[TABLE]
Li’s criterion states that the Riemann hypothesis holds if and only if for all [4].
Let denote an undirected graph of finite order allowing loops and multiple edges. We endow two opposite orientations on all edges of called the oriented edges of . Given a vertex of the valency of is the number of oriented edges with the initial vertex . If the valency of is equal to a constant for all vertices of then is said to be -regular. The adjacency matrix of is a square matrix indexed by the vertices of whose -entry is defined as the number of oriented edges from to for all vertices of . Since is symmetric is diagonalizable with real eigenvalues. The eigenvalues of are also called the eigenvalues of . A walk is a nonempty finite sequence of oriented edges which joins vertices. The length of a walk is the number of oriented edges in the walk. The graph is said to be connected if there exists a walk from to for any two distinct vertices of . A cycle is meant to be a walk from a vertex to itself. If all cycles on have even length then is called bipartite. A walk is said to have backtracking if an oriented edge is immediately followed by its opposite orientation in the walk. A cycle is said to be geodesic if all shifted cycles are backtrackless. For all let denote the number of geodesic cycles on of length . The Ihara zeta function of is the analytic continuation of
[TABLE]
For the rest of this paper, we always assume that is a connected -regular undirected graph of finite order with and . In this case, the eigenvalues of with absolute value are called trivial eigenvalues and the poles of with values and are called trivial poles. The graph is said to be Ramanujan whenever
[TABLE]
for all nontrivial eigenvalues of [5]. The graph is Ramanujan if and only if all nontrivial poles of have the same absolute value , which is similar to the Riemann hypothesis by writing [3, 8]. We define the function by
[TABLE]
The function is considered as the Ihara xi function which satisfies the functional equation
[TABLE]
If we set , then this becomes a functional equation relating and similar to the Riemann xi function.
Definition 1.1**.**
Let denote the number sequence given by
[TABLE]
The main results of this paper are as follows:
Theorem 1.2**.**
If there is a positive even integer with then
[TABLE]
for all nontrivial eigenvalues of .
Theorem 1.3**.**
The following are equivalent:
- (i)
* is Ramanujan.* 2. (ii)
* for all .* 3. (iii)
* for infinitely many even .*
Theorem 1.4**.**
- (i)
If is nonbipartite, then is Ramanujan if and only if
[TABLE] 2. (ii)
If is bipartite, then is Ramanujan if and only if
[TABLE]
Theorem 1.2 is an improvement of the implication from Theorem 1.3(iii) to Theorem 1.3(i). The equivalence of Theorem 1.3(i), (ii) is an analogue of Li’s criterion. In [7, §1.3] it was shown that if is nonbipartite Ramanujan then ; if is bipartite Ramanujan then for even . Theorem 1.4 strengthens the above necessary conditions for as Ramanujan. Furthermore, Theorem 1.4 is an analogue of the Hasse–Weil bound [9].
The paper is organized as follows: In §2 we give some preliminaries on and . In §3 we derive three formulae for . In §4 we prove Theorems 1.2–1.4. In §5 we discuss the behavior of when is not Ramanujan.
2. The Ihara zeta and xi functions
Let denote the spectrum of ; that is the multiset of all eigenvalues of with geometric multiplicities. Since is a connected -regular undirected graph, the value with multiplicity one. Ihara’s theorem [2] states that is a rational function of the form
[TABLE]
Substituting (5) into (4) yields that
[TABLE]
Let denote the multiset of all nontrivial eigenvalues of with geometric multiplicities. Recall that is symmetric with respect to [math] when is bipartite. Hence
[TABLE]
Combined with (8) we obtain that
[TABLE]
Proposition 2.1**.**
* satisfies the functional equation .*
Proof.
It is routine to verify the proposition by using (12). ∎
3. Formulae for
Recall the sequence from Definition 1.1. In this section we give two combinatorial formulae for and a formula for in terms of the Chebyshev polynomials.
Proposition 3.1**.**
- (i)
If is nonbipartite then
[TABLE] 2. (ii)
If is bipartite then
[TABLE]
Proof.
Taking logarithm on (1) yields that
[TABLE]
Evaluate by using (4) and (13) directly. ∎
Let denote the polynomials defined by
[TABLE]
with and [1, §2.3]. Note that is the th Chebyshev polynomial of the first kind for all [6].
Lemma 3.2** ([1, 6]).**
* for all .*
Given a multiset of numbers and a constant , we let denote the multiset consisting of for all .
Proposition 3.3**.**
For all the following equation holds:
[TABLE]
Proof.
Let . Applying (12) yields that
[TABLE]
Let be given. Write for some nonzero complex number . Then
[TABLE]
It follows from Lemma 3.2 that . By the above comments we have
[TABLE]
Now the proposition follows by taking differential on both sides of the above equation. ∎
For convenience we define and for all .
Lemma 3.4** ([1, 6]).**
* for all .*
For all let denote the number of the cycles on of length and define .
Lemma 3.5**.**
* for all .*
Proof.
Evaluate the left-hand side by using Lemma 3.4 along with the fact for all . ∎
Combining Propositions 3.1 and 3.3 yields that
[TABLE]
As far as we know, the formula (16) was first given in [7, Lemma 4] and it was given a proof of [7, Lemma 4] without using (5). By Lemma 3.5 and (16) we have the following lemma:
Lemma 3.6**.**
The following equation holds:
[TABLE]
Proposition 3.7**.**
- (i)
If is nonbipartite then
[TABLE] 2. (ii)
If is bipartite then
[TABLE]
Proof.
Combine Proposition 3.1 and Lemma 3.6. ∎
4. Proof of the main results
In this section we show Theorems 1.2–1.4.
Lemma 4.1**.**
For all the coefficient if and only if
[TABLE]
Proof.
Immediate from Proposition 3.3. ∎
Lemma 4.2** ([6]).**
* for all and all real numbers .*
Lemma 4.3**.**
If is a real number with then for all .
Proof.
Immediate from Lemma 4.2. ∎
Lemma 4.4**.**
If is Ramanujan then for all and all .
Proof.
Since is Ramanujan if and only if for all , the lemma is immediate from Lemma 4.3. ∎
Lemma 4.5** ([6]).**
* for all .*
Lemma 4.6**.**
If is a real number with then for all even .
Proof.
Immediate from Lemma 4.5. ∎
Proposition 4.7**.**
Let denote a nonempty finite multiset consisting of real numbers. If there is a positive even integer with
[TABLE]
then for all .
Proof.
For convenience let
[TABLE]
Suppose on the contrary that there is a real number with
[TABLE]
Using (19) yields that . Since we have . Combined with Lemma 4.5 this implies
[TABLE]
By Lemmas 4.3 and 4.6 we have for all .
Combining (17) with the above comments yields that
[TABLE]
It leads to
[TABLE]
Since is even the inequality (19) implies that
[TABLE]
Combining (20) and (21) we see that
[TABLE]
Using the setting (18) it is routine to verify that both sides of (22) are equal, a contradiction. The proposition follows. ∎
Proof of Theorem 1.2. By Lemma 4.1, when is nonbipartite the result follows by applying Proposition 4.7 with replaced by .
Note that the number of zeros in is even if the regular graph is bipartite. Since is even it follows from Lemma 3.2 that is an even function. Combined with Lemma 4.1, when is bipartite the result follows by applying Proposition 4.7 with chosen as the multiset of all positive numbers and a half number of zeros in .
Proof of Theorem 1.3. (i) (ii): Combine Lemmas 4.1 and 4.4.
(ii) (iii): It is obvious.
(iii) (i): Immediate from Theorem 1.2.
Lemma 4.8**.**
If is Ramanujan then
[TABLE]
for all .
Proof.
By Proposition 3.3 and Lemma 4.4 the coefficient for all . Hence the lemma follows by (11). ∎
Proof of Theorem 1.4. Combine Theorem 1.3(i), (ii) and Proposition 3.1 along with Lemma 4.8.
5. Behavior of
We end this paper with a remark on under the assumption that is not Ramanujan. Let denote the set of all nonzero complex numbers with . For those with the corresponding numbers have the same absolute value . By the assumption that is not Ramanujan there exists an with and the corresponding numbers are real and . Let
[TABLE]
Since the function is strictly increasing on , it follows that
[TABLE]
Using Lemma 3.2 yields that
[TABLE]
for all . It follows from Proposition 3.3 that is asymptotic to as approaches to , where is the number of with . Therefore the following result holds:
Theorem 5.1**.**
If is not Ramanujan then
[TABLE]
where is over all nontrivial eigenvalues of .
Acknowledgements
The research is supported by the Ministry of Science and Technology of Taiwan under the project MOST 106-2628-M-008-001-MY4.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H.-W. Huang, Center of the universal Askey–Wilson algebra at roots of unity , Nuclear Physics B 909 (2016), 260–296.
- 2[2] Y. Ihara, On discrete subgroups of the two by two projective linear group over 𝔭 𝔭 \mathfrak{p} -adic fields , Journal of the Mathematical Society of Japan 18 (1966), 219–235.
- 3[3] W.-C. W. Li, Zeta and L 𝐿 L -functions in number theory and combinatorics , Regional Conference Series in Mathematics 129, American Mathematical Society, Providence, RI, 2019.
- 4[4] X.-J. Li, The positivity of a sequence of numbers and the Riemann hypothesis , Journal of Number Theory 65 (1997), 325–333.
- 5[5] A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs , Combinatorica 8 (1988), 261–277.
- 6[6] J. C. Mason and D. C. Handscomb, Chebyshev polynomials , Chapman and Hall/CRC, New York, 2003.
- 7[7] B. Rangarajan, A combinatorial proof of Ihara–Bass’s formula for the zeta function of regular graphs , In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). (Germany), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2018.
- 8[8] A. A. Terras, Zeta functions of graphs: A stroll through the garden , Cambridge Studies in Advanced Mathematics 128, Cambridge University Press, Cambridge, UK; New York, 2010.
