Advertisement

Ramanujan Cayley Graphs of the Generalized Quaternion Groups and the Hardy–Littlewood Conjecture

  • Yoshinori YamasakiEmail author
Chapter
Part of the Mathematics for Industry book series (MFI, volume 29)

Abstract

Ramanujan graphs are graphs which have many connections with various mathematical fields including an application to the cryptography. In this article, as a continuous work of our research on Ramanujan graphs, we investigate the bound of the valency of the Cayley graphs of the generalized quaternion groups which guarantees to be Ramanujan. As is the cases of the cyclic and dihedral groups, we show that the determination of the bound in a special setting is related to the classical Hardy–Littlewood conjecture for primes represented by a quadratic polynomial.

Keywords

Ramanujan graphs Generalized quaternion groups Hardy–Littlewood conjecture 

Notes

Acknowledgements

The author thanks the referee for helpful comments on the manuscript. Moreover, the author also would like to thank Miki Hirano and Kohei Katata for variable discussion.

References

  1. 1.
    N. Alon, Y. Roichman, Random Cayley graphs and expanders. Random Struct. Algorithms 5, 271–284 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    L. Babai, Spectra of Cayley graphs. J. Comb. Theory Ser. B 27, 180–189 (1979)Google Scholar
  3. 3.
    D. Charles, K. Lauter, E. Goren, Cryptographic hash functions from expander graphs. J. Cryptol. 22, 93–113 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    G.H. Hardy, J.E. Littlewood, Some problems of ‘Partitio numerorum’; III: on the expression of a number as a sum of primes. Acta Math. 44, 1–70 (1923)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    M. Hirano, K. Katata, Y. Yamasaki, Ramanujan circulant graphs and the conjecture of Hardy-Littlewood and Bateman-Horn (submitted) (2016)Google Scholar
  6. 6.
    M. Hirano, K. Katata, Y. Yamasaki, Ramanujan Cayley graphs of Frobenius groups. Bull. Aust. Math. Soc. 94, 373–383 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    S. Hoory, N. Linial, A. Wigderson, Expander graphs and their applications. Bull. Am. Math. Soc. 43, 439–561 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    M. Krebs, A. Shaheen, Expander Families and Cayley Graphs. A Beginner’s Guide (Oxford University Press, Oxford, 2011)Google Scholar
  9. 9.
    A. Lubotzky, Expander graphs in pure and applied mathematics. Bull. Am. Math. Soc. 49, 113–162 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan graphs. Combinatorica 8, 261–277 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    A. Terras, Zeta Functions of Graphs, A Stroll Through the Garden. Cambridge Studies in Advanced Mathematics, vol. 128 (Cambridge University Press, Cambridge, 2011)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Graduate School of Science and EngineeringEhime UniversityMatsuyama, EhimeJapan

Personalised recommendations