A determinant involving Ramanujan sums and So’s conjecture

We compute the determinant of a matrix containing Ramanujan sums associated to the divisors of an integer n, and use this computation to prove a weak version of So’s conjecture on circulant graphs with integral spectrum.

Here μ denotes the Möbius function, ϕ Euler's function, and (n, m) is the greatest common divisor of n and m. Later τ (n) denotes the number of divisors of n.
Ramanujan sums occur naturally in various problems involving discrete Fourier transforms. Here we only want to stress the relation to arithmetic functions, as described in the book by Schwarz and Spilker [2].
Denote be D(n) the set of divisors of n. In this note, we compute the determinant of the matrix C n = (c(d, t)) d,t∈D (n) . We prove the following. Note that as we did not specify an order for the divisors, the determinant is only determined up to a sign. From Theorem 1, we immediately obtain the following.

Corollary 2.
For every n, we have that the matrix C n is invertible.
While the calculation of determinants involving arithmetic functions is an area of some activity going back to Smith's computation [3] of det((i, j)) n i,j=1 , the main reason that we are interested in this matrix comes from its connection to certain Cayley graphs. Let S = {a 1 , . . . , a k } ⊆ {0, 1, 2, . . . , n 2 } be a generating system of Z/nZ, and G the Cayley graph of Z/nZ with respect to ±S. So [4] showed that G has integral spectrum if and only if there exists a set T ⊆ D(n) such that S = {i : (i, n) ∈ T }. He conjectured that the spectrum of G determines n and S. The multi-set of eigenvalues of G is { d∈S c( , n d ) : 1 ≤ ≤ n}. As a weakening of So's conjecture, Sander and Sander [1] conjectured that if S is a set of divisors of n, then the vector d∈S c( , n d ) n =1 determines S. As c( , n d ) depends only on ( , n), this is equivalent to the statement that the restriction of C n to {0, 1} τ (n) is injective. We conclude that Corollary 2 implies the following.

Corollary 3. If S is a set of divisors of the integer n, then the vector
The same result has been obtained independently by Mönius (unpublished). The function that maps a divisor set S to the multi-set of eigenvalues of the associated Cayley graph can be seen as the composition of the map sending S to the spectral vector and the forgetful map interpreting the vector as a multiset. So by Corollary 3, So's conjecture is equivalent to the question when the second map is injective. Here we use Corollary 3 to prove the following. As an abbreviation, we put L(n) = exp (log n) 2/3 log log n . Proposition 4. 1. Suppose that n has no pair of distinct divisors t 1 , t 2 such that ϕ(n/t 1 ) ≤ ϕ(n/t 2 ) < 2 with the possible exception of t 1 = n, t 2 = n/2. Then So's conjecture holds for n. 2. So's conjecture holds for almost all integers n such that n has no prime divisor < L(n).
The first statement generalizes the result by Sander and Sander [1] who proved So's conjecture if n is a prime power.

Proofs.
We prove Theorem 1 by induction over the number of prime divisors of n. For n = 1, we have C 1 = (1). Now let n, a be positive integers, p a prime number which does not divide n, we shall compute det C p a n . Let d 1 , . . . , d k be the divisors of n. We order the divisors of p a n as Then C p a n can be written as an (a + 1) × (a + 1) block matrix ⎛ where , , that is, A ji = (p − 1)p j−1 A 00 . We conclude that up to a permutation of the rows and columns C p a n equals ⎛ We now add the first block column to the second, then the second to the third, and continue in this way. We find that det C p a n = ± det By our inductive hypothesis, we obtain |det C p a n | = p a(a+1) 2 τ (n) n τ (a) 2 (a+1) = (p a n) (a+1)τ (n) 2 = (p a n) τ (p a n) 2 , and the proof of Theorem 1 is complete.
As the proofs of Corollary 2 and 3 are obvious, we now turn to the proof of Proposition 4. Suppose there are two different spectral vectors v 1 , v 2 associated to the divisor sets S 1 , S 2 which are mapped to the same multi-set. Then there is some integer x such that v 1 and v 2 have the same number of entries equal to x, but there exists some index i such that the i-th entry of v 1 is equal to x, while the i-th entry of v 2 is not equal to x. As the level sets of v 1 , v 2 are unions of sets of the form {i : (i, n) = t} for some divisor t of n, we obtain that there are two non-empty sets T 1 , T 2 of divisors of n such that T 1 = T 2 , We now show that under the condition in Proposition 4(1) this cannot happen. Suppose first that n ∈ T 1 . We have c(n, n/d) = ϕ(n/d) ≥ c(n/t, n/d) for all t, together with the fact that d∈S1 ϕ(n/d) = d∈S2 ϕ(n/d) we obtain that d∈S1 c(n, n/d) = d∈S2 c(n, n/d) implies (n/d, n/t) = n/d for all d ∈ S 2 . In other words, we have t|d for all d ∈ S 2 . But this contradicts the assumption that S 2 is a generating system of Z/nZ.
If n is not in T 1 , let t 0 ∈ T 1 ΔT 2 be minimal. As T 1 and T 2 are different, the symmetric difference is non-empty, that is, t 0 certainly exists. Without loss, we may assume that t 0 ∈ T 1 , and we have 2 τ (n) > 0, which is impossible. Hence, the first part of the proposition follows.
For the second statement of the proposition, we show that almost all integers n, which have no prime divisor p < L(n), satisfy the assumption of the first statement. Denote by P − (n) the smallest prime divisor of n, and let Φ(x, y) be the number of integers n ≤ x such that P − (n) ≤ y. The following is well known, see e.g. [5,chapter III.6.2] for much more precise results.

Lemma 5.
There exist positive constants c 1 , c 2 such that for all real numbers x, y satisfying 2 ≤ y ≤ x 2 , we have We now show that for almost all integers n satisfying P − (n) ≥ L(n), there do not exist divisors d 1 = d 2 of n such that ϕ(d 1 ) ≤ ϕ(d 2 ) < 2ϕ(d 1 ).
If P − (n) ≥ L(n), then for every divisor d of n, we have Put y = L(x). Then the number of tripels is bounded above by , y x log y .
Introducing t as the greatest common divisor of d 1 and d 2 , this quantity becomes and the proof is complete.
Funding Open Access funding enabled and organized by Projekt DEAL.
Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons. org/licenses/by/4.0/.
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.