Distance Graphs in Vector Spaces Over Finite Fields
From MaRDI portal
Publication:2840649
DOI10.1007/978-1-4614-4565-4_14zbMath1278.11012arXiv0804.3036OpenAlexW310653540MaRDI QIDQ2840649
Alexander Iosevich, Steven Senger, Doowon Koh, Ignacio Uriarte-Tuero, Derrick N. Hart
Publication date: 23 July 2013
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.3036
Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (3)
Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates ⋮ A General Framework for Studying Finite Rainbow Configurations ⋮ Distribution of the determinants of sums of matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Sum-product estimates via directed expanders
- Ubiquity of simplices in subsets of vector spaces over finite fields
- Finite Euclidean graphs and Ramanujan graphs
- Character tables of association schemes of affine type
- Finite analogues of Euclidean space
- Erdös distance problem in vector spaces over finite fields
This page was built for publication: Distance Graphs in Vector Spaces Over Finite Fields