Papers
Topics
Authors
Recent
Search
2000 character limit reached

Paley-like quasi-random graphs arising from polynomials

Published 15 May 2024 in math.CO and math.NT | (2405.09319v1)

Abstract: Paley graphs and Paley sum graphs are classical examples of quasi-random graphs. In this paper, we provide new constructions of families of quasi-random graphs that behave like Paley graphs but are neither Cayley graphs nor Cayley sum graphs. These graphs give a unified perspective of studying various graphs arising from polynomials over finite fields such as Paley graphs, Paley sum graphs, and graphs coming from Diophantine tuples and their generalizations. We also provide new lower bounds on the clique number and independence number of general quasi-random graphs. In particular, we give a sufficient condition for the clique number of quasi-random graphs of $n$ vertices to be at least $(1-o(1)\log_{3.008}n$. Such a condition applies to many classical quasi-random graphs, including Paley graphs and Paley sum graphs, as well as some new Paley-like graphs we construct.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (47)
  1. A. Abiad and S. Zeijlemaker. A unified framework for the Expander Mixing Lemma for irregular graphs and its applications. arXiv:2401.07125, 2024.
  2. N. Alon. On the quasirandomness of (n,d,λ)𝑛𝑑𝜆(n,d,\lambda)( italic_n , italic_d , italic_λ )-graphs. manuscript, 2020.
  3. List coloring of random and pseudo-random graphs. Combinatorica, 19(4):453–472, 1999.
  4. Finiteness results for F𝐹Fitalic_F-Diophantine sets. Monatsh. Math., 180(3):469–484, 2016.
  5. J. Borbély and A. Sárközy. Quasi-random graphs, pseudo-random graphs and pseudorandom binary sequences, I. (Quasi-random graphs). Unif. Distrib. Theory, 14(2):103–126, 2019.
  6. A. E. Brouwer and H. Van Maldeghem. Strongly regular graphs, volume 182 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2022.
  7. Y. Bugeaud and K. Gyarmati. On generalizations of a problem of Diophantus. Illinois J. Math., 48(4):1105–1115, 2004.
  8. J. Byrne and M. Tait. Improved upper bounds on even-cycle creating Hamilton paths. arXiv:2304.02164, 2023.
  9. An exponential improvement for diagonal Ramsey. arXiv: 2303.09521, 2023.
  10. F. Chung and R. Graham. Sparse quasi-random graphs. Combinatorica, 22(2):217–244, 2002.
  11. F. R. K. Chung. Constructing random-like graphs. In Probabilistic combinatorics and its applications (San Francisco, CA, 1991), volume 44 of Proc. Sympos. Appl. Math., pages 21–55. Amer. Math. Soc., Providence, RI, 1991.
  12. F. R. K. Chung. Spectral graph theory, volume 92 of CBMS Regional Conference Series in Mathematics. Conference Board of the Mathematical Sciences, Washington, DC; by the American Mathematical Society, Providence, RI, 1997.
  13. Quasi-random graphs. Combinatorica, 9(4):345–362, 1989.
  14. S. D. Cohen. Clique numbers of Paley graphs. Quaestiones Math., 11(2):225–231, 1988.
  15. D. Conlon. A note on the Ramsey number of Paley graphs. manuscript, 2009.
  16. E. S. Croot, III and V. F. Lev. Open problems in additive combinatorics. In Additive combinatorics, volume 43 of CRM Proc. Lecture Notes, pages 207–233. Amer. Math. Soc., Providence, RI, 2007.
  17. On the directions determined by a Cartesian product in an affine Galois plane. Combinatorica, 41(6):755–763, 2021.
  18. Generalized Diophantine m𝑚mitalic_m-tuples. Proc. Amer. Math. Soc., 150(4):1455–1465, 2022.
  19. A. Dujella and M. Kazalicki. Diophantine m𝑚mitalic_m-tuples in finite fields and modular forms. Res. Number Theory, 7(1):Paper No. 3, 24, 2021.
  20. P. Erdös and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463–470, 1935.
  21. Lower bounds for least quadratic nonresidues. In Analytic number theory (Allerton Park, IL, 1989), volume 85 of Progr. Math., pages 269–309. Birkhäuser Boston, Boston, MA, 1990.
  22. The Paley graph conjecture and Diophantine m𝑚mitalic_m-tuples. J. Combin. Theory Ser. A, 170:105155, 9, 2020.
  23. K. Gyarmati. On a problem of Diophantus. Acta Arith., 97(1):53–65, 2001.
  24. K. Gyarmati and A. Sárközy. Equations in finite fields with restricted solution sets. I. Character sums. Acta Math. Hungar., 118(1-2):129–148, 2008.
  25. B. Hanson and G. Petridis. Refined estimates concerning sumsets contained in the roots of unity. Proc. Lond. Math. Soc. (3), 122(3):353–358, 2021.
  26. The variation of the spectrum of a normal matrix. Duke Math. J., 20:37–39, 1953.
  27. Sets with integral distances in finite fields. Trans. Amer. Math. Soc., 362(4):2189–2204, 2010.
  28. Diophantine tuples and multiplicative structure of shifted multiplicative subgroups. arXiv:2309.09124, 2023.
  29. Explicit constructions of Diophantine tuples over finite fields. To appear in Ramanujan J., arXiv: 2404.05514, 2024.
  30. A. Kisielewicz and W. Peisert. Pseudo-random properties of self-complementary symmetric graphs. J. Graph Theory, 47(4):310–316, 2004.
  31. Turán’s theorem for pseudo-random graphs. J. Combin. Theory Ser. A, 114(4):631–657, 2007.
  32. M. Krivelevich and B. Sudakov. Pseudo-random graphs. In More sets, graphs and numbers, volume 15 of Bolyai Soc. Math. Stud., pages 199–262. Springer, Berlin, 2006.
  33. V. F. Lev. Discrete norms of a matrix and the converse to the expander mixing lemma. Linear Algebra Appl., 483:158–181, 2015.
  34. R. Lidl and H. Niederreiter. Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, second edition, 1997.
  35. Q. Lin and Y. Li. Quasi-random graphs of given density and Ramsey numbers. Pure Appl. Math. Q., 18(6):2537–2549, 2022.
  36. H. L. Montgomery. Topics in multiplicative number theory. Lecture Notes in Mathematics, Vol. 227. Springer-Verlag, Berlin-New York, 1971.
  37. V. Nikiforov. More spectral bounds on the clique and independence numbers. J. Combin. Theory Ser. B, 99(6):819–826, 2009.
  38. M. Sadek and N. El-Sissi. On large F𝐹Fitalic_F-Diophantine sets. Monatsh. Math., 186(4):703–710, 2018.
  39. J. Solymosi. Clique number of Paley graphs. manuscript, 2020.
  40. C. L. Stewart. On sets of integers whose shifted products are powers. J. Combin. Theory Ser. A, 115(4):662–673, 2008.
  41. A. Thomason. Pseudorandom graphs. In Random graphs ’85 (Poznań, 1985), volume 144 of North-Holland Math. Stud., pages 307–331. North-Holland, Amsterdam, 1987.
  42. A. Thomason. Random graphs, strongly regular graphs and pseudorandom graphs. In Surveys in combinatorics 1987 (New Cross, 1987), volume 123 of London Math. Soc. Lecture Note Ser., pages 173–195. Cambridge Univ. Press, Cambridge, 1987.
  43. A. Thomason. A Paley-like graph in characteristic two. J. Comb., 7(2-3):365–374, 2016.
  44. Q. Xiang. Cyclotomy, Gauss sums, difference sets and strongly regular Cayley graphs. In Sequences and their applications—SETA 2012, volume 7280 of Lecture Notes in Comput. Sci., pages 245–256. Springer, Heidelberg, 2012.
  45. C. H. Yip. Exact values and improved bounds on the clique number of cyclotomic graphs. arXiv:2304.13213, 2023.
  46. C. H. Yip. Multiplicatively reducible subsets of shifted perfect k𝑘kitalic_k-th powers and bipartite Diophantine tuples. arXiv:2312.14450, 2023.
  47. C. H. Yip. On the clique number of Paley graphs of prime power order. Finite Fields Appl., 77:Paper No. 101930, 2022.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (3)

  1. Seoyoung Kim 
  2. Chi Hoi Yip 
  3. Semin Yoo 

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Tweets

Sign up for free to view the 3 tweets with 0 likes about this paper.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up for Free