<p>A graph is called integral if its eigenvalues are integers. In this article, we provide necessary and sufficient conditions for a Cayley graph over a finite symmetric algebra <i>R</i> to be integral. This generalizes the work of So who studies the case where <i>R</i> is the ring of integers modulo <i>n</i>. We also explain some number-theoretic constructions of finite symmetric algebras arising from global fields, which we hope could pave the way for future studies on Paley graphs associated with finite Hecke characters.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Integral Cayley graphs over a finite symmetric algebra

  • Tung T. Nguyen,
  • Nguyễn Duy Tân

摘要

A graph is called integral if its eigenvalues are integers. In this article, we provide necessary and sufficient conditions for a Cayley graph over a finite symmetric algebra R to be integral. This generalizes the work of So who studies the case where R is the ring of integers modulo n. We also explain some number-theoretic constructions of finite symmetric algebras arising from global fields, which we hope could pave the way for future studies on Paley graphs associated with finite Hecke characters.