Skip to main content

Part of the book series: Advanced Courses in Mathematics - CRM Barcelona ((ACMBIRK))

Abstract

In this contribution we give incidence bounds for arrangements of curves in F q 2. As an application, we prove a new result that, if (x, f (x)) is a Sidon set, then either A+A or f(A)+f(A) should be large. The main goal of the paper is to illustrate the use of graph spectral techniques in additive combinatorics. This is an extended version of the talks I gave in the Additive Combinatorics DocCourse held at the CRM in Barcelona and at the conference “Fete of Combinatorics” held in Keszthely.

The research was conducted while the author was a member of the Institute for Advanced Study. Funding provided by The Charles Simonyi Endowment. The research was supported by NSERC and OTKA grants and by Sloan Research Fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. P.K. Agarwal and M. Sharir, Pseudoline Arrangements: Duality, Algorithms, and Applications, manuscript, 2001.

    Google Scholar 

  2. N. Alon and J. Spencer, The Probabilistic Method, 3rd. ed., Wiley, 2008.

    Google Scholar 

  3. J. Beck and V.T. Sós, Discrepancy theory, Handbook of Combinatorics, Chapter 26, Graham, Grötschel, and Lovász, eds., North-Holland, Amsterdam, 1995, pp. 1405–1446.

    Google Scholar 

  4. N. Biggs, Algebraic Graph Theory, 2nd ed., Cambridge University Press, 1993.

    Google Scholar 

  5. R.C. Bose, Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math. 13 (1963), no. 2, 389–419.

    MATH  MathSciNet  Google Scholar 

  6. J. Bourgain, N. Katz, and T. Tao, A sumproduct estimate in finite fields and applications, Geom. Funct. Anal., 14 (2004), 27–57.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Bourgain, personal communication, October 10, 2007.

    Google Scholar 

  8. B. Chazelle, The Discrepancy Method: Randomness and Complexity, Cambridge University Press, 2000.

    Google Scholar 

  9. J. Cheeger, A lower bound for the smallest eigenvalue of the Laplacian, Problems in Analysis, Papers dedicated to Salomon Bochner, Princeton University Press, Princeton, 1969, 195–199.

    Google Scholar 

  10. F.R.K. Chung, Spectral Graph Theory, Amer. Math. Soc., Providence, RI, 1997.

    MATH  Google Scholar 

  11. Gy. Elekes, On the Number of Sums and Products, Acta Arith. 81 (1997), no. 4, 365–367.

    MATH  MathSciNet  Google Scholar 

  12. P. Erdős and E. Szemerédi, On sums and products of integers, Studies in Pure Mathematics, Birkhäuser, Basel, 1983, pp. 213–218.

    Google Scholar 

  13. Gy. Elekes, M. B. Nathanson, and I. Z. Ruzsa, Converxity and Sumsets J. Number Theory 83 (1999), 194–201.

    Article  MathSciNet  Google Scholar 

  14. M. Z. Garaev, An Explicit Sum-Product Estimate in F q , Int. Math. Res. Not. 2007 (2007), 1–11.

    Google Scholar 

  15. R. Graham, B. Rothschild, and J. Spencer, Ramsey Theory, Wiley-Intersc. Ser. in Discrete Math. Optim, Wiley, New York, 1990.

    Google Scholar 

  16. A. Granville, M.B. Nathanson, and J. Solymosi, Additive Combinatorics, CRM Proceedings & Lecture Notes, vol. 43, Amer. Math. Soc.,. 2007.

    Google Scholar 

  17. C. Godsil and G. Royle, Algebraic Graph Theory, Grad. Texts in Math., vol. 207, Springer, New York, 2001.

    MATH  Google Scholar 

  18. L. Lovász, Combinatorial Problems and Exercises, AMS Chelsea Publishing, 1979.

    Google Scholar 

  19. -, Spectra of graphs with transitive groups, Period. Math. Hungar. 6 (1975), no. 2, 191–195.

    Google Scholar 

  20. L. Lovász, J. Spencer, and K. Vesztergombi, Discrepancy of set systems and matrices, European J. Combin. 7 (1986), 151–160.

    MATH  MathSciNet  Google Scholar 

  21. J. Pach and P. Agarwal, Combinatorial Geometry, Wiley, New York, 1995.

    MATH  Google Scholar 

  22. K.F. Roth, On certain sets of integers, I, J. London Math. Soc. 28 (1953), 104–109.

    Article  MATH  MathSciNet  Google Scholar 

  23. -, Remark concerning integer sequences, Acta Arith. 9 (1964) 257–260.

    MATH  MathSciNet  Google Scholar 

  24. E Szemerédi and W.T. Trotter, Extremal problems in discrete geometry, Combinatorica 3 (1983), 381–392.

    Article  MATH  MathSciNet  Google Scholar 

  25. T. Tao and V. Vu, Additive Combinatorics, Cambridge Stud. Adv. Math., vol. 105, Cambridge University Press, 2006.

    Google Scholar 

  26. L.A. Vinh, Szemeredi-Trotter type theorem and sum-product estimate in finite fields, preprint. arXiv:0711.4427v1.

    Google Scholar 

  27. V.H. Vu, Sum-product estimates via directed expanders, Math. Res. Lett. 15 (2008), no. 2, 375–388.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Birkhäuser Verlag

About this chapter

Cite this chapter

Solymosi, J. (2009). Incidences and the spectra of graphs. In: Combinatorial Number Theory and Additive Group Theory. Advanced Courses in Mathematics - CRM Barcelona. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-8962-8_22

Download citation

Publish with us

Policies and ethics