Skip to main content

Part of the book series: CRM Series ((CRMSNS,volume 16))

  • 872 Accesses

Abstract

We prove a transference type result for pseudo-random subsets of ℤN that is analogous to the well-known Fürstenberg-Sárközy theorem. More precisely, let k ≥ 2 be an integer and let β and γ be real numbers satisfying

$$ \gamma + (\gamma - \beta )/2^{k + 1} - 3) > 1 $$

. Let Γ ⊆ ℤ N be a set with size at least N γ and linear bias at most N β. Then, every A ⊆ Γ with relative density \( \left| A \right|/\left| \Gamma \right| \geqslant (\log \log N)^{ - \frac{1} {2}\log \log \log \log \log N} \) contains a pair of the form {x, x + d k} for some nonzero integer d.

For instance, for squares, i.e., k = 2, and assuming the best possible pseudorandomness β = γ/2 our result applies as soon as γ > 10/11.

Our approach uses techniques of Green as seen in [6] relying on a Fourier restriction type result also due to Green.

Supported by FAPESP (Proc. 2010/16526-3) and by CNPq (Proc. 477203/2012-4) and by NUMEC/USP.

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

Access this chapter

eBook
USD 24.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 34.99
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.

References

  1. A. Balog, J. Pelikán, J. Pintz and E. Szemerédi, Difference sets without κth powers, Acta Math. Hungar. 65(2) (1994), 165–187.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Conlon and W. T. Gowers, Combinatorial theorems in sparse random sets, submitted.

    Google Scholar 

  3. D. Conlon, J. Fox and Y. Zhao, Extremal results in sparse pseudorandom graphs, submitted.

    Google Scholar 

  4. H. Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Analyse Math. 31 (1977), 204–256.

    Article  MATH  MathSciNet  Google Scholar 

  5. B. Green, Roth’s theorem in pseudorandom sets, manuscript.

    Google Scholar 

  6. B. Green, Roth’s theorem in the primes, Ann. of Math. (2) 161(3)(2005), 1609–1636.

    Article  MATH  MathSciNet  Google Scholar 

  7. I. Łaba and M. Hamel, Arithmetic structures in random sets, Integers 8 (2008).

    Google Scholar 

  8. H. H. Nguyen, On two-point configurations in random set, Integers 9 (2009), 41–45.

    Article  MathSciNet  Google Scholar 

  9. J. Pintz, W. L. Steiger and E. Szemerédi, On sets of natural numbers whose difference set contains no squares, J. London Math. Soc. (2) 37(2) (1988), 219–231.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Sàrk-”ozy, On difference sets of sequences of integers. I, Acta Math. Acad. Sci. Hungar. 31(1–2) (1978), 125–149.

    Article  MathSciNet  Google Scholar 

  11. M. Schacht, Extremal results for random discrete structures, submitted.

    Google Scholar 

  12. T. Tao and V. H. Vu, “Additive Combinatorics”, Cambridge Studies in Advanced Mathematics, Vol. 105, Cambridge University Press, Cambridge, 2010.

    Google Scholar 

  13. P. A. Tomas, A restriction theorem for the Fourier transform, Bull. Amer. Math. Soc. 81 (1975), 477–478.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jaroslav Nešetřil Marco Pellegrini

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Scuola Normale Superiore Pisa

About this paper

Cite this paper

Aigner-Horev, E., Hàn, H. (2013). On two-point configurations in subsets of pseudo-random sets. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_67

Download citation

Publish with us

Policies and ethics