Skip to main content

Distance Graphs in Vector Spaces Over Finite Fields

  • Conference paper
  • First Online:
Recent Advances in Harmonic Analysis and Applications

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 25))

Abstract

In this chapter we systematically study various properties of the distance graph in \({\mathbb{F}}_{q}^{d}\), the d-dimensional vector space over the finite field \({\mathbb{F}}_{q}\) with q elements. In the process we compute the diameter of distance graphs and show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configuration.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Bannai, E., Shimabukuro, O., Tanaka, H.: Finite Euclidean graphs and Ramanujan graphs. Discrete Math. 309, 6126–6134 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hart, D., Iosevich, A.: Ubiquity of simplices in subsets of vector spaces over finite fields. Anal. Mathematika34, 29–38 (2007)

    Article  MathSciNet  Google Scholar 

  3. Iosevich, A., Rudnev, M.: Erdős distance problem in vector spaces over finite fields. Trans. Amer. Math. Soc. 12, 6127–6142 (2007)

    Article  MathSciNet  Google Scholar 

  4. Iwaniec, H., Kowalski, E.: Analytic Number Theory, vol. 53. AMS Colloquium Publications, Providence (2004)

    MATH  Google Scholar 

  5. Krivilevich, M., Sudakov, B.: Pseudo-random graphs. In: More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies vol. 15, pp. 199–262. Springer, New York (2006)

    Google Scholar 

  6. Kwok, W.M.: Character tables of association schemes of affine type. European J. Combin.13, 167–185 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  8. Medrano, A., Myers, P., Stark, H.M., Terras, A.: Finite analogs of Euclidean space. J. Comput. Appl. Math. 68, 221–238 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. Vinh, L.: Explicit Ramsey graphs and Erdös distance problem over finite Euclidean and non-Euclidean spaces, Math. Res. Lett.15(2), 375–388 (2008) arXiv:0711.3508

    Google Scholar 

  10. Vinh, L., Dung, D.: Explicit tough Ramsey graphs. In: Proceedings of the International Conference on Relations, Orders and Graphs: Interaction with Computer Science, Nouha Editions, pp. 139–146 (2008)

    Google Scholar 

  11. Vu, V.: Sum-Product estimates via directed expanders, Math. Res. Lett. 15(2), 375–388 (2008)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alex Iosevich .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media, LLC

About this paper

Cite this paper

Hart, D., Iosevich, A., Koh, D., Senger, S., Uriarte-Tuero, I. (2012). Distance Graphs in Vector Spaces Over Finite Fields. In: Bilyk, D., De Carli, L., Petukhov, A., Stokolos, A., Wick, B. (eds) Recent Advances in Harmonic Analysis and Applications. Springer Proceedings in Mathematics & Statistics, vol 25. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4565-4_14

Download citation

Publish with us

Policies and ethics