Abstract
We study a family of variants of Erdő’s unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of n points E, we look for bounds on how many subsets of k points satisfy a set of relationships between point pairs based on distances or dot products. We survey some of the recent work in the area and present several new, more general families of bounds.
Keyword
- Point Configurations
This is a preview of subscription content, access via your institution.
Buying options
References
P. Bahls, Channel assignment on Cayley graphs. J. Graph Theory, 67: 169–177 (2011). https://doi.org/10.1002/jgt.20523
D. Barker and S. Senger, Upper bounds on pairs of dot products. Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 103, November, 2017, pp. 211–224.
J. J. Benedetto and M. Fickus, Finite normalized tight frames. Adv. Comput. Math. 18, pp. 357–385 (2003).
M. Bennett, A. Iosevich, and K. Taylor, Finite chains inside thin subsets of \({\mathbb{R}}^d\), Analysis and PDE, volume 9, no. 3 (2016).
P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry. Springer (2000), 499 pp.
D. Covert and S. Senger, Pairs of dot products in finite fields and rings, Nathanson M. (eds) Combinatorial and Additive Number Theory II. CANT 2015, CANT 2016. Springer Proceedings in Mathematics & Statistics, vol 220. Springer, Cham.
J. DeWitt, K. Ford, E. Goldstein, S. Miller, G. Moreland, E. Palsson, and S. Senger, Dimensional lower bounds for Falconer type incidence and point configuration theorems, with Journal d’Analyse Mathématique 139, 143–154 (2019).
P. Erdős, On sets of distances of \(n\) points. Amer. Math. Monthly 53 (1946) 248–250.
P. Erdős, On sets of distances of \(n\) points in Euclidean space, Magyar Tudományos Akadémia Matemakai Kutató Intézet Közleményi 5 (1960) 165–169.
J. Fox, J. Pach, A. Suk, A. Sheffer, and J. Zahl, A semi-algebraic version of Zarankiewicz’s problem. Journal of the European Mathematical Society, Volume 19, Issue 6, 2017, pp. 1785–1810. https://doi.org/10.4171/JEMS/705.
N. Frankl and A. Kupavskii, Almost sharp bounds on the number of discrete chains in the plane, arXiv:1912.00224.
J. Garibaldi, A. Iosevich, and S. Senger, Erdős distance problem, AMS Student Library Series, 56, (2011).
D. Hart, A. Iosevich, D. Koh, and M. Rudnev, Averages over hyperplanes, sum-product theory in finite fields, and the Erdős-Falconer distance conjecture. Trans. Amer. Math. Soc., 363 (2011) pp. 3255–3275.
A. Iosevich, M. Rudnev, Erdös distance problem in vector spaces over finite fields. Trans. Amer. Math. Soc. 359 (2007), no. 12, 6127–6142.
A. Iosevich and S. Senger, Orthogonal systems in vector spaces over finite fields. Electronic J. of Combinatorics, Volume 15, December (2008).
S. Kilmer, C. Marshall, and S. Senger, Dot product chains, arXiv:2006.11467.
B. Lund, Incidences and pairs of dot products, arXiv:1509.01072.
B. Lund, A. Sheffer, and F. de Zeeuw, Bisector energy and few distinct distances, F. Discrete Comput Geom (2016) 56: 337. https://doi.org/10.1007/s00454-016-9783-5.
Y. Ou and K. Taylor, Finite point configurations ad the regular value theorem in a fractal setting, arXiv:2005.12233 (2020).
E. Palsson, A. Scheffer, and S. Senger, On the number of discrete chains, arXiv:1902.08259, (2019) (submitted).
S. Senger, Explorations of the Erdős-Falconer distance problem and related applications, Dissertation, Univ. of Missouri (2011).
J. Spencer, E. Szemerédi, W. T. Trotter. Unit distances in the Euclidean plane, Graph theory and combinatorics (1984): 293–303.
E. Szemerédi and W. T. Trotter, Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), no. 3–4, pp. 381–392.
S. Steinerberger, A note on the number of different inner products generated by a finite set of vectors. Discrete Mathematics, 310, (2010), pp. 1112–1117.
J. Zahl, Breaking the 3/2 Barrier for Unit Distances in Three Dimensions, Int. Math. Res. Notices, rnx336, (2018).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Gunter, S., Palsson, E., Rhodes, B., Senger, S. (2021). Bounds on Point Configurations Determined by Distances and Dot Products. In: Nathanson, M.B. (eds) Combinatorial and Additive Number Theory IV. CANT 2020. Springer Proceedings in Mathematics & Statistics, vol 347. Springer, Cham. https://doi.org/10.1007/978-3-030-67996-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-67996-5_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67995-8
Online ISBN: 978-3-030-67996-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)