On two-point configurations in subsets of pseudo-random sets

Similar documents
POLYNOMIAL CONFIGURATIONS IN SUBSETS OF RANDOM AND PSEUDO-RANDOM SETS

ARITHMETIC STRUCTURES IN RANDOM SETS. Mariah Hamel Department of Mathematics, University of British Columbia, Vancouver, B.C.

The Green-Tao theorem and a relative Szemerédi theorem

The Green-Tao theorem and a relative Szemerédi theorem

POINCARÉ RECURRENCE AND NUMBER THEORY: THIRTY YEARS LATER

A PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS

Long Arithmetic Progressions in A + A + A with A a Prime Subset 1. Zhen Cui, Hongze Li and Boqing Xue 2

MONOCHROMATIC SCHUR TRIPLES IN RANDOMLY PERTURBED DENSE SETS OF INTEGERS

Minimum degree conditions for large subgraphs

A DEGREE VERSION OF THE HILTON MILNER THEOREM

A NEW PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS

The dichotomy between structure and randomness. International Congress of Mathematicians, Aug Terence Tao (UCLA)

1.1 Szemerédi s Regularity Lemma

PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS

Off-diagonal hypergraph Ramsey numbers

Additive Combinatorics and Computational Complexity

Roth s Theorem on Arithmetic Progressions

On reducible and primitive subsets of F p, II

Roth s theorem on 3-arithmetic progressions. CIMPA Research school Shillong 2013

The 3-colored Ramsey number of odd cycles

Dept of Math., SCU+USTC

NEIL LYALL A N. log log N

Higher-order Fourier analysis of F n p and the complexity of systems of linear forms

Rotated Corners in the Integer Lattice

arxiv: v1 [math.nt] 14 Sep 2017

AN IMPROVED ERROR TERM FOR MINIMUM H-DECOMPOSITIONS OF GRAPHS. 1. Introduction We study edge decompositions of a graph G into disjoint copies of

New lower bounds for hypergraph Ramsey numbers

arxiv:math/ v3 [math.co] 15 Oct 2006

Ewan Davies Counting in hypergraphs via regularity inheritance

A REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES

A REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES.

Configurations in sets big and small

CHARACTERISTIC POLYNOMIAL PATTERNS IN DIFFERENCE SETS OF MATRICES

The Diophantine equation x(x + 1) (x + (m 1)) + r = y n

SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS

MULTIPLE HARMONIC SUMS AND MULTIPLE HARMONIC STAR SUMS ARE (NEARLY) NEVER INTEGERS

FROM HARMONIC ANALYSIS TO ARITHMETIC COMBINATORICS: A BRIEF SURVEY

Roth s Theorem on 3-term Arithmetic Progressions

ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS

SQUARES AND DIFFERENCE SETS IN FINITE FIELDS

POLYNOMIALS AND PRIMES IN GENERALIZED ARITHMETIC PROGRESSIONS (REVISED VERSION) 1. Introduction

A PROBABILISTIC THRESHOLD FOR MONOCHROMATIC ARITHMETIC PROGRESSIONS

DEGREE OF EQUIVARIANT MAPS BETWEEN GENERALIZED G-MANIFOLDS

ON RESTRICTED ARITHMETIC PROGRESSIONS OVER FINITE FIELDS

Erdős and arithmetic progressions

On Periodic points of area preserving torus homeomorphisms

Remarks on a Ramsey theory for trees

The regularity method and blow-up lemmas for sparse graphs

BURGESS INEQUALITY IN F p 2. Mei-Chu Chang

The Number of Independent Sets in a Regular Graph

The regularity method and blow-up lemmas for sparse graphs

Solving a linear equation in a set of integers II

Subset sums modulo a prime

On a certain generalization of the Balog-Szemeredi-Gowers theorem

ON `-TH ORDER GAP BALANCING NUMBERS

A Note on a Standard Family of Twist Mappings

THE IMPLICIT FUNCTION THEOREM FOR CONTINUOUS FUNCTIONS. Carlos Biasi Carlos Gutierrez Edivaldo L. dos Santos. 1. Introduction

Pseudorandomness in Computer Science and in Additive Combinatorics. Luca Trevisan University of California, Berkeley

The Erdős-Hajnal hypergraph Ramsey problem

MEASURES OF PSEUDORANDOMNESS FOR FINITE SEQUENCES: MINIMUM AND TYPICAL VALUES (EXTENDED ABSTRACT)

Polynomial configurations in fractal sets

Distinct volume subsets

Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems

NOTE. On a Problem of Erdo s and Sa rko zy

Maximum union-free subfamilies

Szemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA)

The Green-Tao Theorem on arithmetic progressions within the primes. Thomas Bloom

Square-Difference-Free Sets of Size Ω(n )

Limits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes

Tiling on multipartite graphs

250 G. ALKAUSKAS and A. DUBICKAS Baker and Harman [2] proved that the sequence [ο p ] (where p runs over the primes) contains infinitely many prime nu

VAN DER WAERDEN S THEOREM.

Sum and shifted-product subsets of product-sets over finite rings

ON STRUCTURE AND COMMUTATIVITY OF NEAR - RINGS

SZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS

Arithmetic progressions in sumsets

Some unsolved problems in additive/combinatorial number theory. W. T. Gowers

A simple computable criteria for the existence of horseshoes

On some inequalities between prime numbers

On graphs decomposable into induced matchings of linear sizes

Bipartite Graph Tiling

HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?

FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures)

Partial difference equations over compact Abelian groups

#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES

Applications of the Sparse Regularity Lemma

arxiv: v3 [math.co] 23 Jun 2008

Mathematics and Computer Science

arxiv: v2 [math.nt] 21 May 2016

A PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO Introduction

arxiv: v1 [math.mg] 10 Feb 2017

ON VAN DER CORPUT PROPERTY OF SQUARES. University of Zagreb, Croatia

RECIPES FOR TERNARY DIOPHANTINE EQUATIONS OF SIGNATURE (p, p, k)

A sequence of triangle-free pseudorandom graphs

SHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS. Joanna Polcyn. Department of Discrete Mathematics Adam Mickiewicz University

Disjoint Subgraphs in Sparse Graphs 1

arxiv: v1 [math.ra] 25 Nov 2017

arxiv: v1 [math.ds] 13 Jul 2015

Constructions in Ramsey theory

The cycle polynomial of a permutation group

Transcription:

On two-point configurations in subsets of pseudo-random sets Elad Aigner-Horev 2 Department of Mathematics University of Hamburg Bundesstrasse 55 D-20146 Hamburg, Germany Hiệp Hàn 1,3 Instituto de Matemática e Estatística Universidade de São Paulo Rua do Matão 1010, 05508 090 São Paulo, Brazil Abstract We prove a transference type result for pseudo-random subsets of Z 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 +( )/(2 k+1 3) > 1. Let Z N be a set with size at least N and linear bias at most N. Then, every A with relative density A / (log log N) 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 pseudo-randomness = /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.

1 Introduction A classical result in additive combinatorics, proved independently by Sárközy [10] and Fürstenberg [4], states that subsets of the first N integers with positive density contains a pair which di er by a perfect k-th power, i.e., a pair {x, x + d k } for some d>0. As a quantitative version it is known due to [9,1] that this conclusion already holds for sets A of density (1) A /N (log N) c log log log log N for some c>0 In this note we consider the problem of extending (1) to hold for subsets of vanishing relative density of sparse pseudorandom subsets of Z N. This type of extensions are commonly calledtransference results in which an extremal problem known for dense objects is transferred or carried over to sparse objects taken from a well-behaved universe like a random or a pseudorandom set. We refer to [7,8,11,2,3,6] for further information. Qualitative transference of (1) tosparserandomsetswere first considered in [7]. Later on, Nguyen [8] proved that with high probability every relatively dense subset of random sets R [N] of size (N 1 1/k )containstheconfiguration{x, x + d k }, for some nonzero d. Up to a multiplicative constant this density attained for the random host is best possible. It is also interesting to note that Tao and Ziegler proved that the polynomial Szemerédi theorem also holds in the primes. Their proof relies heavily on pseudo-random properties of the primes, thus, can be seen in the scheme mentioned above. For a classical notion of pseudo-randomness defined by small nontrivial Fourier coe cients, however, nothing is known concerning extensions of (1) andourtheorem1.1 shall give the first nontrivial bound for this setting. Our main result. Before stating the result we require some notation. For the purposes of Fourier analysis we endow Z N 1 Supported by FAPESP (Proc. 2010/16526-3) and by CNPq (Proc. 477203/2012-4) and by NUMEC/USP. 2 Email: elad.horev@math.uni-hamburg.de 3 Email: hh@ime.usp.br

with the counting measure and, consequently, endow its dual group Z b N with the uniform measure. As a result, given a function f : Z N! C the Fourier transform of f is defined to be the function f b : Z b N! C given by f( ) b = P x2z f(x)e( x) where e(x) =e 2 ix/n. We write kfk u =sup b 06= 2Z b N f( ) b to denote magnitude of the second largest Fourier coe cient of f, and call kfk u the linear bias of f. Given f,g : Z N! C, the convolution of f and g is given by f g(x) = P y2z N f(y)g(x y). We identify a set with its characteristic function, i.e., if A Z N then A also denotes a 0, 1-function with A(x) =1ifand only if x 2 A. Finally, let Q k = {x k : x apple N 1/k,x is integer } denote the set of kth powers. Our main result reads as follows. Theorem 1.1 Let k 2 be an integer and let > > 0 be reals with +( )/(2 k+1 3) > 1. Then there is an n 0 such that for all N>n 0 the following holds. Let Z N satisfy N and k k u apple N, and let = (N) (log log N) 1 2 log log log log log N. Then, every subset A satisfying A contains the configuration {x, x + d} A where d 2 Q k. It is worth to note that the proof of Theorem 1.1 does not merely guarantee one desired configuration but many. Indeed, the number of such configurations found in the subset A is at least 2 Q k N 1, where = ( ) > 0if 6= 0. Up to ( ) this bound is clearly best possible. Moreover, let us emphasise that in Theorem 1.1 we can handle subsets of whose relative density is vanishing as N goes to infinity. This is due to the fact that we are transferring the quantitative version of the dense case of the Fürstenberg-Sárközy theorem, namely (1). Due to Parseval s equality the the parameter in Theorem 1.1 controlling the pseudo-randomness of satisfies /2. That is, one may think of = /2 asthough is as pseudo-random as possible. In this case, i.e., = /2, we 1 have that Theorem 1.1 is applicable as long as > 1. 2 k+2 5

2 Sketch of the proof of Theorem 1.1 Our approach follows that of Green [6]. Given = (N) we introduce functions,,and" depending on N so that " > 0. Given the set A and a set of frequencies ;6= S Z b N we know that there is a % = %(N) 2 ["/2, "] such that the Bohr set B = B(S, %) isaregular (see, e.g. [12], chapter 4.4). Define the function a : Z N! R given by a(x) = N (A B)(x) whichcanbeshowntohavecertainattributes B seen in characteristic functions of dense sets; that is kak`1 N and kak 1 apple 3, provided k ku 1 > 2("/(20 S 1/2 )) S. Applying(1) combinedwithavarnavidestypeargumentthen yields a lower bound on the of number of desired configurations in a (2) (a, Q k )= X a(x)a(x + d)q k (d) N Q k. x,d2z N Due to the convolution property and assuming that A contains less than N 1+1/k pairs of the form {x, x k },wehave (a, Q k ) < N X (3) A( ) b 2 Q c 2 k ( ) 2Z b N b B( ) 2 B 2 1 + 2 N 1+1/k from which we then derive a contradiction to (2). To this end, we split the sum into two sums; one ranging over 2 S = Spec (A) ={ 2 Z b N : A( ) b } and another ranging over 62 S. It can be shown that b B( ) 2 B 2 1 apple 2" for all 2 S and S apple (2/ ) (2 2 )/( ) from which we conclude that for the first sum ranging over S is at most 2% S b A(0) 2 c Q k (0) apple 2 Q k /4. Handling the sum over b Z N \ S, however, is more complicated. In fact, its proof is a central part of the proof of Theorem 1.1 but due to space limitation we omit it here. Nevertheless, we mention that the main tools in the proof are Waring s theorem and a restriction type result due to Green [5] which is similar to that used in [6]. It is a close adaption of the restriction theorem due to Stein-Tomas [13]. We omit the details.

References [1] A. Balog, J. Pelikán, J. Pintz, and E. Szemerédi, Di erence sets without appleth powers, Acta Math. Hungar. 65 (1994), no. 2, 165 187. [2] D. Conlon and W.T. Gowers, Combinatorial theorems in sparse random sets, submitted. [3] David Conlon, Jacob Fox, and Yufei Zhao, Extremal results in sparse pseudorandom graphs, submitted. [4] Harry Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Analyse Math. 31 (1977), 204 256. [5] B. Green, Roth s theorem in pseudorandom sets, manuscript. [6] Ben Green, Roth s theorem in the primes, Ann. of Math. (2) 161 (2005), no. 3, 1609 1636. [7] I. Laba and M. Hamel, Arithmetic structures in random sets, Integers: Elec. J. of combin. num. th. 8 (2008), 21. [8] H. H. Nguyen, On two-point configurations in random set, Integers 9 (2009), 41 45. [9] János Pintz, W. L. Steiger, and Endre Szemerédi, On sets of natural numbers whose di erence set contains no squares, J. London Math. Soc. (2) 37 (1988), no. 2, 219 231. [10] A. Sárkőzy, On di erence sets of sequences of integers. I, Acta Math. Acad. Sci. Hungar. 31 (1978), no. 1 2, 125 149. [11] M. Schacht, Extremal results for random discrete structures, submitted. [12] T. Tao and V. H. Vu, Additive combinatorics, Cambridge Studies in Advanced Mathematics, vol. 105, Cambridge University Press, Cambridge, 2010. [13] Peter A. Tomas, A restriction theorem for the Fourier transform, Bull. Amer. Math. Soc. 81 (1975), 477 478.