Finite Euclidean graphs and Ramanujan graphs

Eiichi Bannai, Osamu Shimabukuro, Hajime Tanaka

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

We consider finite analogues of Euclidean graphs in a more general setting than that considered in [A. Medrano, P. Myers, H.M. Stark, A. Terras, Finite analogues of Euclidean space, J. Comput. Appl. Math. 68 (1996) 221-238] and we obtain many new examples of Ramanujan graphs. In order to prove these results, we use the previous work of [W.M. Kwok, Character tables of association schemes of affine type, European J. Combin. 13 (1992) 167-185] calculating the character tables of certain association schemes of affine type. A key observation is that we can obtain better estimates for the ordinary Kloosterman sum K (a, b ; q). In particular, we always achieve | K (a, b ; q) | < 2 sqrt(q), and | K (a, b ; q) | ≤ 2 sqrt(q - 2) in many (but not all) of the cases, instead of the well known | K (a, b ; q) | ≤ 2 sqrt(q). Also, we use the ideas of controlling association schemes, and the Ennola type dualities, in our previous work on the character tables of commutative association schemes. The method in this paper will be used to construct many more new examples of families of Ramanujan graphs in the subsequent paper.

Original languageEnglish
Pages (from-to)6126-6134
Number of pages9
JournalDiscrete Mathematics
Volume309
Issue number20
DOIs
Publication statusPublished - 2009 Oct 28
Externally publishedYes

Keywords

  • Association scheme
  • Euclidean graph
  • Kloosterman sum
  • Quadratic form
  • Ramanujan graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Finite Euclidean graphs and Ramanujan graphs'. Together they form a unique fingerprint.

Cite this