SearcharxivSearch

arXiv · 1808.01391

Spectra of Cayley graphs

Abstract

Let $G$ be a group and $S\subseteq G$ its subset such that $S=S^{-1}$, where $S^{-1}=\{s^{-1}\mid s\in S\}$. Then {\it the Cayley graph ${\rm Cay}(G,S)$} is an undirected graph $Γ$ with the vertex set $V(Γ)=G$ and the edge set $E(Γ)=\{(g,gs)\mid g\in G, s\in S\}$. A graph $Γ$ is said to be {\it integral} if every eigenvalue of the adjacency matrix of $Γ$ is integer. In the paper, we prove the following theorem: {\it if a subset $S=S^{-1}$ of $G$ is normal and $s\in S\Rightarrow s^k\in S$ for every $k\in \mathbb{Z}$ such that $(k,|s|)=1$, then ${\rm Cay}(G,S)$ is integral.} In particular, {\it if $S\subseteq G$ is a normal set of involutions, then ${\rm Cay}(G,S)$ is integral.} We also use the theorem to prove that {\it if $G=A_n$ and $S=\{(12i)^{\pm1}\mid i=3,\dots,n\}$, then ${\rm Cay}(G,S)$ is integral.} Thus, we give positive solutions for both problems 19.50(a) and 19.50(b) in "Kourovka Notebook".

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenbin Guo, Daria V. Lytkina, Victor D. Mazurov, Danila O. Revin. 2018-08-03. Spectra of Cayley graphs. https://doi.org/10.1007/s10469-019-09550-2

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR