Punctured point spectrum of a four-regular bipartite Cayley graph

Let \(G=\langle a,t\mid a^3=t^2=1\rangle\) and \(S=\{a^ita^j:1\le i,j\le2\}\). The Cayley graph \(\Gamma=\operatorname{Cay}(G,S)\) is infinite, connected, simple, four-regular, bipartite and vertex-transitive. Its adjacency operator on \(\mathbb C^G\) has point spectrum exactly \(\mathbb C\setminus\{0\}\). We give its inverse as a sum of nine translations and construct an eigenfunction for every nonzero complex number using two-dimensional representations of \(G\). In particular, \(\Gamma\) answers Kourovka Problem 15.89 negatively. The graph properties, inverse and complete point-spectrum statement are formalised in Lean 4.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-12
DOI
https://doi.org/10.5281/zenodo.22722076
Primary Topic
Finite Group Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Punctured point spectrum of a four-regular bipartite Cayley graph

Achyuth Jayadevan
Zenodo (CERN European Organization for Nuclear Research)
Finite Group Theory Research
preprint

Punctured point spectrum of a four-regular bipartite Cayley graph

Achyuth Jayadevan
preprint en

Abstract

Let \(G=\langle a,t\mid a^3=t^2=1\rangle\) and \(S=\{a^ita^j:1\le i,j\le2\}\). The Cayley graph \(\Gamma=\operatorname{Cay}(G,S)\) is infinite, connected, simple, four-regular, bipartite and vertex-transitive. Its adjacency operator on \(\mathbb C^G\) has point spectrum exactly \(\mathbb C\setminus\{0\}\). We give its inverse as a sum of nine translations and construct an eigenfunction for every nonzero complex number using two-dimensional representations of \(G\). In particular, \(\Gamma\) answers Kourovka Problem 15.89 negatively. The graph properties, inverse and complete point-spectrum statement are formalised in Lean 4.

Zenodo (CERN European Organization for Nuclear Research)
Manipal Academy of Higher Education (IN)
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.