Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-20T02:45:04.757Z Has data issue: false hasContentIssue false
  • English
  • Français

ON SUM OF PRODUCTS AND THE ERDŐS DISTANCE PROBLEM OVER FINITE FIELDS

Part of: Sequences and sets

Published online by Cambridge University Press:  21 June 2011

LE ANH VINH
LE ANH VINH*
Affiliation:
Mathematics Department, Harvard University, Cambridge, MA, 20138, USA (email: vinh@math.harvard.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

For a prime power q, let 𝔽q be the finite field of q elements. We show that 𝔽*q⊆d𝒜2 for almost every subset 𝒜⊂𝔽q of cardinality ∣𝒜∣≫q1/d. Furthermore, if q=p is a prime, and 𝒜⊆𝔽p of cardinality ∣𝒜∣≫p1/2(log p)1/d, then d𝒜2 contains both large and small residues. We also obtain some results of this type for the Erdős distance problem over finite fields.

Keywords

sum of productsErdős distance problem

MSC classification

Secondary: 11B75: Other combinatorial number theory
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 84 , Issue 1 , August 2011 , pp. 1 - 9
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2011

References

[1]Alon, N. and Spencer, J. H., The Probabilistic Method, 2nd edn. (Wiley-Interscience, New York, 2000).CrossRefGoogle Scholar
[2]Covert, D., Hart, D., Iosevich, A., Koh, D. and Rudnev, M., ‘Generalized incidence theorems, homogeneous forms and sum–product estimates in finite fields’, European J. Combin. 31 (2010), 306–319.CrossRefGoogle Scholar
[3]Drmota, M. and Tichy, R., Sequence, Discrepancies and Applications (Springer, Berlin, 1997).CrossRefGoogle Scholar
[4]Garaev, M. Z. and Garcia, V. C., ‘The equation x 1x 2=x 3x 4+λ in fields of prime order and applications’, J. Number Theory 128 (2008), 2520–2537.CrossRefGoogle Scholar
[5]Glibichuk, A. A. and Konyagin, S. V., ‘Additive properties of product sets in fields of prime order’, in: Additive Combinatorics, CRM Proceedings and Lecture Notes, 43 (American Mathematical Society, Providence, RI, 2007), pp. 279–286.CrossRefGoogle Scholar
[6]Hart, D. and Iosevich, A., ‘Sums and products in finite fields: an integral geometric viewpoint’, in: Radon Transforms, Geometry, and Wavelets, Contemporary Mathematics, 464 (American Mathematical Society, Providence, RI, 2008), pp. 129–135.CrossRefGoogle Scholar
[7]Hart, D., Iosevich, A., Koh, D. and Rudnev, M., ‘Averages over hyperplanes, sum–product theory in vector spaces over finite fields and the Erdős–Falconer distance conjecture’, Trans. Amer. Math. Soc. 363 (2011), 3255–3275.CrossRefGoogle Scholar
[8]Iosevich, A. and Rudnev, M., ‘Erdős distance problem in vector spaces over finite fields’, Trans. Amer. Math. Soc. 359 (2007), 6127–6142.CrossRefGoogle Scholar
[9]Katz, N. M., Shparlinski, I. E. and Xiong, M., ‘On character sums with distances on the upper half plane over a finite field’, Preprint, 2009.CrossRefGoogle Scholar
[10]Medrano, A., Myers, P., Stark, H. M. and Terras, A., ‘Finite analogues of Euclidean space’, J. Comput. Appl. Math. 68 (1996), 221–238.CrossRefGoogle Scholar
[11]Nguyen, H. H., ‘On two-point configurations in a random set’, Integers 9 (2009), 41–45.CrossRefGoogle Scholar
[12]Shparlinski, I. E., ‘On some generalisations of the Erdős distance problem over finite fields’, Bull. Aust. Math. Soc. 73 (2006), 285–292.CrossRefGoogle Scholar
[13]Shparlinski, I. E., ‘On the set of distances between two sets over finite fields’, Int. J. Math. Math. Sci. 2006 (2006), Article ID 59482.CrossRefGoogle Scholar
[14]Solymosi, J., Bounding multiplicative energy by the sumset, arXiv:0806.1040.Google Scholar
[15]Vinh, L. A., ‘Explicit Ramsey graphs and Erdős distance problem over finite Euclidean and non-Euclidean spaces’, Electron. J. Combin. 15 (2008), Article R5.CrossRefGoogle Scholar