NEIL LYALL A N. log log N
|
|
- Mary Walker
- 6 years ago
- Views:
Transcription
1 SÁRKÖZY S THEOREM NEIL LYALL. Introduction The purpose of this expository note is to give a self contained proof (modulo the Weyl ineuality) of the following result, due independently to Sárközy [5] and Furstenberg []. Theorem. Let δ >, then there exists N = N (δ) such that if N N and A [, N] with A δn, then A necessarily contains distinct elements a, b whose difference a b is a perfect suare. We will closely follow the approach taken in Lyall and Magyar [3] and employ a density increment strategy to obtain the result above with () N = exp(cδ log δ ). This is euivalent to the statement that if A [, N] and d / A A for any d, then necessarily () A N C log log N log N.. Dichotomy between randomness and arithmetic structure Our approach will be to obtain a dichotomy between randomness and structure of the following form. Proposition. Let A [, N] and δ = A /N. If N δ C with C sufficiently large, then either N ( (3) A A + d ) / δ A N d= or there exists a suare difference arithmetic progression P in [, N] of length P cδ 5 N such that (4) A P > δ( + cδ) P. Proof that Proposition implies Theorem (with bound ()). Suppose A [, N], with A δn, contains no suare differences, then Proposition allows us to perform an iteration. At the kth step of this iteration we will have a set A k [, N k ] of size δ k N k. This set will be an appropriately rescaled version of a subset of A itself and hence will also contain no suare differences. Let A = A, N = N and δ = A /N δ. Proposition ensures that either (5) N k δ C k or else the iteration proceeds allowing us to choose N k+, δ k+ and A k+ such that and N k+ cδ 5 kn k δ k+ δ k + cδ k. Now as long as the iteration continues we must have δ k, and so after O(δ ) iterations condition (5) must be satisfied, giving δ Cδ N δ C log N Cδ log δ. The rest of this note is devoted to the proof of Proposition. As opposed to the standard L increment strategy of Roth, we will obtain the dichotomy in Proposition by exploiting the concentration of the L mass of the Fourier transform (this sometimes referred to as an energy increment strategy).
2 NEIL LYALL 3. Setting the stage for the proof of Proposition Let A [, N], with N δ C, where δ = A /N and C is a sufficiently large constant. Our approach will be to assume that A exhibits neither of the two properties described in Proposition and then seek a contradiction. 3.. A simple conseuence of A being non-random. If we were to suppose that A is non-random, in the sense that ineuality (3) does not hold, then it would immediately follows that (6) A (m) A (n) S (m n) 4 δ A S where m,n Z (7) S = d : d N/9}. 3.. A simple conseuences of A being non-structured. If we were to assume that A is regular, in the sense that A in fact satisfies the ineuality for all arithmetic progressions P [, N] of the form A P δ( + ε) P (8) P = m + l : l L} with L δ 4 εn, then the set A (N/9, 8N/9] must contain most of the elements of A. In particular (9) A (N/9, 8N/9] (3/4) A, since if this were not the case we would immediately obtain a progression P [, N] of the form (8) with = and L N/9 such that A P δ( + /8) P The balance function. We define the balance function of A to be () f A = A δ [,N]. We note that f A has mean value zero, that is f A (m) =, this will be critically important later. It easy to verify that if A satisfies ineualities (6) and (9), then () f A (m)f A (n) S (m n) 4 δ B S. m,n Z One can see this by simply expanding the sum into a sum of four sums, one involving only the function A on which we can apply (6), two involving the functions A and δ [,N] on which we can apply (9), and one involving only the function δ [,N] which can be estimated trivially Fourier analysis on Z. If f : Z C and has finite support, then we define its Fourier transform by f(α) = m Z f(m)e πimα. The finite support assumption on f ensures that f is a continuous function on the circle, and in this setting the Fourier inversion formula and Plancherel s identity, namely f(m) = f(α)e πimα dα and f(α) dα = m Z are simply immediate conseuences of the familiar orthogonality relation e πimα if m = dα =. if m f(m) It is then easy to verify that from ineuality () we immediately obtain the estimate () f A (α) S (α) dα 4 δ B S
3 SÁRKÖZY S THEOREM 3 where we recognize (3) S (α) = as a classical Weyl sum. N/9 d= e πidα, 3.5. Estimates for Weyl sums. Let M = N/9. We note that whenever α M there can be no cancellation in the Weyl sum (3), in fact the same is also true when α is close to a rational with small denominator (i.e. there is no cancellation over sums in residue classes modulo ). We now state a precise formulation of the fact that this is indeed the only obstruction to cancellation. For η > we define (4) M = M (η) = Proposition 3. Let η >. α [, ] : α a η M (i) (Minor arc estimate) If α / M for any η, then S (α) ηm + O(M /4 ). (ii) (Major arc estimate) If α M for some η, then S (α) C / M + O(M / ). } for some a [, ]. The proof of this result is a straightforward (and presumably well known) conseuence of the standard estimates for Weyl sums, for the sake of completeness we include these arguments in an appendix. 4. The proof of Proposition In the previous section we established that ineualities (6) and (9) would be immediate conseuences of A not exhibiting either of the two properties described in Proposition. We now present the two lemmas from which we will obtain our desired contradiction. In both lemmas below we assume that A [, N] and N δ C, where δ = A /N and C is a sufficiently large constant. Moreover, we set η = cδ, where c is a sufficiently small constant. Lemma 4. If A is neither random nor structured, in the sense outlined in Proposition, then there exists η such that (5) f A (α) dα cδ. δ A M The second lemma is a precise uantitative formulation, in our setting, of the standard L density increment lemma. Lemma 5. Let ε η /4π. If A is regular, in the sense that A P δ( + ε) P for all progressions P [, N] of the form (8) with L η εn, then (6) f A (α) dα ε. δ A M We therefore obtain a contradiction if ε cδ, proving Proposition.
4 4 NEIL LYALL 4.. Proof of Lemma 4. It follows from the minor arc estimate of Proposition 3 (since N δ C for C sufficiently large) and Plancherel s identity that f A (α) S (α) dα CηM A. minor arcs Therefore, if η = δ/8c, it follows from estimate () and the major arc estimate of Lemma 3 that It therefore follows that as reuired. M / f A (α) dα η A. η = max f A (α) dα η A η M 4.. Proof of Lemma 5. We fix and L so that L = η εn and define Claim. If α M, then P (α) P /. P = l l L}. Proof of Claim. Since L α L η M = η ε, for all α M, where denotes the distance to the nearest integer, it follows that L P (α) P e πil α ) P ( πl α P /, for all α M, provided ε η /4π. l= We now note that Plancherel s identity (applied to the function f A P ) and Claim imply that (7) f A (α) 4 dα δ A M δ A P f A P (m). The conclusion of Lemma 5 will therefore be an immediate conseuence of the following. m Z Claim. As a conseuence of the assumptions in Lemma 5 if follows that f A P (m) 3ε δ A P. m Z Proof of Claim. We let M = m Z m P [, N]} E = ([, N] + P ) \ M and write f A P (m) = f A P (m) + f A P (m). m Z m E We note that since f A P (m) = A (m P ) δ [, N] (m P ) it follows from our regularity assumption on A that if m M, then while for m E we can only conclude that Now since f A has mean value zero the convolution δl f A P (m) δεl, f A P (m) = n f A P (m) L. f A (n) P (m n)
5 SÁRKÖZY S THEOREM 5 also has mean value zero. Thus, using the fact that g = g + g, where g + = maxg, } denotes the positive-part function, and the trivial size estimate M N, we can deduce that ( ) f A P (m) sup f A P (m) (f A P ) + (m) (δl)(δεl) M δ εl N. Using the fact that E L = η εn, it follows that f A P (m) P E m E provided η δ. This concludes the proof of Claim and establishes Lemma 5. f A P (m), Appendix A. Weyl Sum Estimates: Proof of Proposition 3 A.. Standard estimates for Weyl sums. Let S M (α) = M e πidα. Proposition 6 (The Weyl ineuality). If α a/ and (a, ) =, then d= S M (α) M log M(/ + /M + /M ) /. The proof of this result is completely standard, see for example [4] or []. We remark that this gives a non-trivial estimate whenever M µ M µ for some < µ <. Let (8) M a/ α = [, ] : α a }. M / We say that α is in a minor arc if α / M a/ for any (a, ) = with M /. Lemma 7 (Minor arc estimate I). If α / M a/ for any (a, ) = with M /, then (9) S M (α) CM /4. While on the complement of these minor arcs (the major arcs) we have the follow important estimate. Lemma 8 (Major arc estimate). If α M a/ for some (a, ) = with M /, then () S M (α) CM / ( + M α a/ ) / + O(M / ). For the proofs of these two lemmas see Section A.3. A.. Refinement of the major arcs. We now let < η and define () M a/ = α : α a } η M. Lemmas 7 and 8 combine to give the following result from which Proposition 3 is an immediate conseuence. Lemma 9 (Minor arc estimate II). If α / M a/ for any (a, ) = with η, then S M (α) ηm + O(M /4 ). Proof. It follow from Lemma 8 that on M a/ we have S M (α) ηm provided (a, ) = and either η N / or η M α a/ M +/.
6 6 NEIL LYALL A.3. Proof of Lemmas 7 and 8. Before launching into this, we make the important observation that the major arcs (and hence the refined major arcs) are a union of (necessarily short) pairwise disjoint intervals. Lemma. If a/ a / with, M /, then M a/ M a / =. Proof. Suppose that M a/ M a /. Using the fact that a a, we see that a contradiction. M a / a a a = M, /5 Proof of Lemma 7. It follows from the Dirichlet principle and the fact that α is in a minor arc that there exists a reduced fraction a/ with M / M / such that α a/. It therefore follows from the Weyl ineuality that S M (α) 3M / log M CM /4. Key to the proof of Lemma 8 is the following approximation. Lemma. If α M a/ with M /, then () S M (α) = S(a, )I M (α a/) + O(M /5 ) where S(a, ) := r= e πiar / and I M (β) := M e πiβx dx. Proof. We can write α = a/ + β where β /M / and M /. We can also write each d M uniuely as d = m + r with r and m. It then follows that Since and S M (α) = = r= m= r= e πi(a/+β)(m+r) + O() e πiar / m= e πiβ(m+r) + O(). e πi(m+r)β e πim β e πi(mr+r )β Cdr β CM +/ e πim β m= e πix β dx m= m= m+ m M / e πim β e πix β dx π(m + ) β it follows that SM (α) S(a, )I M (β) CM /5. Lemma 8 then follows almost immediately from the two basic lemmas below. Lemma (Gauss sum estimate). If (a, ) =, then S(a, ). More precisely, if odd S(a, ) = if mod 4. if mod 4
7 SÁRKÖZY S THEOREM 7 Lemma 3 (Oscillatory integral estimate). For any λ e πiλx dx C( + λ) /. Proof of Lemma 8. Lemmas and 3 imply that the main term in () S(a, )I M (α a/) M / ( + M α a/ ) /, and since / M / and M ( α a/ M /, it follows that Proof of Lemma. Suaring-out S(a, ) we obtain M / ( + M α a/ ) / M 9/ M /5. S(a, ) = e πia(r s )/. s= r= Letting r = s + t and using the fact that (a, ) = and e πia(st)/ if at mod = otherwise it follows that S(a, ) = t= s= e πiat / e πia(st)/ = Proof of Lemma 3. We need only consider the case when λ. We write e πiλx dx = s= λ / e πiλx dx + if odd ( e πia(/4) + ) if even. e πiλx λ / dx =: I + I. It is then easy to see that I λ /, while integration by parts gives that I = ( d ) λ 4πiλx dx eπiλx dx / [ ] 4πλ x eπiλx λ x eπiλx dx / Cλ /. λ / + References [] H. Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. d Analyse Math, 7 (977), pp [] W. T. Gowers, Additive and Combinatorial Number Theory, wtg/addnoth.notes.dvi. [3] N. Lyall and Á. Magyar, Polynomial configurations in difference sets, to appear J. Number Theory. [4] H. L. Montgomery, Ten Lectures on the Interface Between Analytic Number Theory and Harmonic Analysis, CBMS Regional Conference Series in Mathematics, 84. [5] A. Sárzözy, On difference sets of seuences of integers III, Acta Math. Acad. Sci. Hungar. 3 (978), pp
OPTIMAL POLYNOMIAL RECURRENCE
OPTIMAL POLYNOMIAL RECURRENCE NEIL LYALL ÁKOS MAGYAR Abstract. Let P Z[n] with P (0) = 0 and ε > 0. We show, using Fourier analytic techniques, that if N exp exp(cε 1 log ε 1 ) and A 1,..., N}, then there
More informationGOLDBACH S PROBLEMS ALEX RICE
GOLDBACH S PROBLEMS ALEX RICE Abstract. These are notes from the UGA Analysis and Arithmetic Combinatorics Learning Seminar from Fall 9, organized by John Doyle, eil Lyall, and Alex Rice. In these notes,
More informationRoth s Theorem on Arithmetic Progressions
September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper
More informationRotated Corners in the Integer Lattice
Rotated Corners in the Integer Lattice Hans Parshall Abstract In this paper we prove the existence of rotated corners within positive density subsets of the lattice [, N] for sufficiently large N. We further
More informationRoth s Theorem on 3-term Arithmetic Progressions
Roth s Theorem on 3-term Arithmetic Progressions Mustazee Rahman 1 Introduction This article is a discussion about the proof of a classical theorem of Roth s regarding the existence of three term arithmetic
More information8. Dirichlet s Theorem and Farey Fractions
8 Dirichlet s Theorem and Farey Fractions We are concerned here with the approximation of real numbers by rational numbers, generalizations of this concept and various applications to problems in number
More informationON VAN DER CORPUT PROPERTY OF SQUARES. University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 45(65)(2010), 357 372 ON VAN DER CORPUT PROPERTY OF SQUARES Siniša Slijepčević University of Zagreb, Croatia Abstract. We prove that the upper bound for the van der Corput property
More informationA PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO Introduction
A PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO 1 ERNIE CROOT NEIL LYALL ALEX RICE Abstract. Using purely combinatorial means we obtain results on simultaneous Diophantine
More informationROTH S THEOREM THE FOURIER ANALYTIC APPROACH NEIL LYALL
ROTH S THEOREM THE FOURIER AALYTIC APPROACH EIL LYALL Roth s Theorem. Let δ > 0 and ep ep(cδ ) for some absolute constant C. Then any A {0,,..., } of size A = δ necessarily contains a (non-trivial) arithmetic
More informationDIFFERENCE SETS AND THE IRREDUCIBLES IN FUNCTION FIELDS. 1. Introduction
DIFFERENCE SETS AND THE IRREDUCIBLES IN FUNCTION FIELDS Abstract. Let A be a subset of the polnomials of degree less than N over a finite field F q. Let r be an non-zero element of F q. We show that if
More information1.1 Szemerédi s Regularity Lemma
8 - Szemerédi s Regularity Lemma Jacques Verstraëte jacques@ucsd.edu 1 Introduction Szemerédi s Regularity Lemma [18] tells us that every graph can be partitioned into a constant number of sets of vertices
More informationSzemerédi-Trotter type theorem and sum-product estimate in finite fields
Szemerédi-Trotter type theorem and sum-product estimate in finite fields arxiv:0711.4427v1 [math.co] 28 Nov 2007 Le Anh Vinh Mathematics Department Harvard University Cambridge, MA 02138, US vinh@math.harvard.edu
More informationRoth s theorem on 3-arithmetic progressions. CIMPA Research school Shillong 2013
Roth s theorem on 3-arithmetic progressions CIPA Research school Shillong 2013 Anne de Roton Institut Elie Cartan Université de Lorraine France 2 1. Introduction. In 1953, K. Roth [6] proved the following
More informationThe dichotomy between structure and randomness. International Congress of Mathematicians, Aug Terence Tao (UCLA)
The dichotomy between structure and randomness International Congress of Mathematicians, Aug 23 2006 Terence Tao (UCLA) 1 A basic problem that occurs in many areas of analysis, combinatorics, PDE, and
More informationOn the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences
On the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences J. C. Lagarias A.. Odlyzko J. B. Shearer* AT&T Labs - Research urray Hill, NJ 07974 1. Introduction
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS NIKOS FRANTZIKINAKIS AND BRYNA KRA Abstract. Szemerédi s Theorem states that a set of integers with positive upper density contains arbitrarily
More informationOn a combinatorial method for counting smooth numbers in sets of integers
On a combinatorial method for counting smooth numbers in sets of integers Ernie Croot February 2, 2007 Abstract In this paper we develop a method for determining the number of integers without large prime
More informationarxiv: v2 [math.nt] 21 May 2016
arxiv:165.156v2 [math.nt] 21 May 216 PROGRESSION-FREE SETS IN Z n 4 ARE EXPONENTIALLY SMALL ERNIE CROOT, VSEVOLOD F. LEV, AND PÉTER PÁL PACH Abstract. We show that for integer n 1, any subset A Z n 4 free
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationPOLYNOMIALS AND PRIMES IN GENERALIZED ARITHMETIC PROGRESSIONS (REVISED VERSION) 1. Introduction
POLYNOMIALS AND PRIMES IN GENERALIZED ARITHMETIC PROGRESSIONS REVISED VERSION ERNIE CROOT NEIL LYALL ALEX RICE Abstract. We provide upper bounds on the density of a symmetric generalized arithmetic progression
More informationDISTANCE GRAPHS AND SETS OF POSITIVE UPPER DENSITY IN R d. 1. Introduction
DISTANCE GRAPHS AND SETS OF POSITIVE UPPER DENSITY IN R d NEIL LYALL ÁKOS MAGYAR Abstract. We present a refinement and sharp extension of a result of Bourgain on finding configurations of k + 1 points
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationDisjoint Subgraphs in Sparse Graphs 1
Disjoint Subgraphs in Sparse Graphs 1 Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 OWB, UK jbav2@dpmms.cam.ac.uk
More informationVan der Corput sets with respect to compact groups
Van der Corput sets with respect to compact groups Michael Kelly and Thái Hoàng Lê Abstract. We study the notion of van der Corput sets with respect to general compact groups. Mathematics Subject Classification
More informationSUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS
SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds in finite fields using incidence theorems
More informationTight Bound for the Density of Sequence of Integers the Sum of No Two of which is a Perfect Square
DIMACS Technical Report 2000-39 April 200 Tight Bound for the Density of Sequence of Integers the Sum of No Two of which is a erfect Square by Ayman Khalfalah Email: akhalfal@cs.rutgers.edu Address: Dept.
More informationRoth s Theorem on Arithmetic Progressions
Roth s Theorem on Arithmetic Progressions Ernie Croot April 3, 004 1 Introduction Here we give a proof of the following classical theorem of K. F. Roth: Theorem 1 There exists a constant c > 0 so that
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationAlgebraic Structures of Numbers. Andrejs Treibergs. September 8, 2009
Math 3210 2. Algebraic Structures of Numbers Andrejs Treibergs University of Utah September 8, 2009 2. Peano Axioms Here are the basic axioms for the Natural Numbers N = {1, 2, 3,...}. N1. There is an
More informationWaring s problem, the declining exchange rate between small powers, and the story of 13,792
Waring s problem, the declining exchange rate between small powers, and the story of 13,792 Trevor D. Wooley University of Bristol Bristol 19/11/2007 Supported in part by a Royal Society Wolfson Research
More informationOn two-point configurations in subsets of pseudo-random sets
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
More informationA PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS
A PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS ERNIE CROOT AND OLOF SISASK Abstract. We present a proof of Roth s theorem that follows a slightly different structure to the usual proofs, in that
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationFrom now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.
Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x
More informationRoth s Theorem on Arithmetic Progressions
CHAPTER 4 Roth s Theorem on Arithmetic Progressions c W W L Chen, 1997, 213. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationExpansions of quadratic maps in prime fields
Expansions of quadratic maps in prime fields Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract Let f(x) = ax 2 +bx+c Z[x] be a quadratic polynomial with
More informationA course in arithmetic Ramsey theory
A course in arithmetic Ramsey theory Frank de Zeeuw May 6, 2017 1 Coloring Theorems 2 1.1 Van der Waerden s Theorem............................ 2 1.2 Bounds for Van der Waerden s Theorem......................
More informationARITHMETIC STRUCTURES IN RANDOM SETS. Mariah Hamel Department of Mathematics, University of British Columbia, Vancouver, B.C.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A04 ARITHMETIC STRUCTURES IN RANDOM SETS Mariah Hamel Department of Mathematics, University of British Columbia, Vancouver, B.C. V6T
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationA REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES.
1 A REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES. P. LEFÈVRE, E. MATHERON, AND O. RAMARÉ Abstract. For any positive integer r, denote by P r the set of all integers γ Z having at
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
More informationRemarks on a Ramsey theory for trees
Remarks on a Ramsey theory for trees János Pach EPFL, Lausanne and Rényi Institute, Budapest József Solymosi University of British Columbia, Vancouver Gábor Tardos Simon Fraser University and Rényi Institute,
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationA REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES
Acta Math. Hungar., 143 (1) (2014), 75 80 DOI: 10.1007/s10474-014-0408-2 Acta Math. Hungar. First published online March 27, DOI: 2014 0 75 A REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES
More informationON RESTRICTED ARITHMETIC PROGRESSIONS OVER FINITE FIELDS
ON RESTRICTED ARITHMETIC PROGRESSIONS OVER FINITE FIELDS BRIAN COOK ÁKOS MAGYAR Abstract. Let A be a subset of F n p, the n-dimensional linear space over the prime field F p of size at least δn (N = p
More informationA MAXIMAL EXTENSION OF THE BEST-KNOWN BOUNDS FOR THE FURSTENBERG-SÁRKÖZY THEOREM
A MAXIMAL EXTENSION OF THE BEST-KNOWN BOUNDS FOR THE FURSTENBERG-SÁRKÖZY THEOREM ALEX RICE Abstract. We show that if h Z[x] is a polynomial of degree k 2 such that hn) contains a multiple of q for every
More informationApplication of Ergodic Theory to Uniform distribution mod 1. Oleg Ivrii
Application of Ergodic Theory to Uniform distribution mod 1 Oleg Ivrii February 13, 2008 Chapter 1 Ergodic Theory 1.1 The Setting Our setting will vary, but (, µ) will be some measure space and T a measure
More informationThe major arcs approximation of an exponential sum over primes
ACTA ARITHMETICA XCII.2 2 The major arcs approximation of an exponential sum over primes by D. A. Goldston an Jose, CA. Introduction. Let. α = Λnenα, eu = e 2πiu, where Λn is the von Mangoldt function
More informationArithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationA NEW PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS
A NEW PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS ERNIE CROOT AND OLOF SISASK Abstract. We present a proof of Roth s theorem that follows a slightly different structure to the usual proofs, in that
More informationON A TWO-DIMENSIONAL SEARCH PROBLEM. Emil Kolev, Ivan Landgev
Serdica Math. J. 21 (1995), 219-230 ON A TWO-DIMENSIONAL SEARCH PROBLEM Emil Kolev, Ivan Landgev Communicated by R. Hill Abstract. In this article we explore the so-called two-dimensional tree search problem.
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More informationON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
More informationON SPECTRAL CANTOR MEASURES. 1. Introduction
ON SPECTRAL CANTOR MEASURES IZABELLA LABA AND YANG WANG Abstract. A probability measure in R d is called a spectral measure if it has an orthonormal basis consisting of exponentials. In this paper we study
More informationFourier Analysis. 1 Fourier basics. 1.1 Examples. 1.2 Characters form an orthonormal basis
Fourier Analysis Topics in Finite Fields (Fall 203) Rutgers University Swastik Kopparty Last modified: Friday 8 th October, 203 Fourier basics Let G be a finite abelian group. A character of G is simply
More informationOn primitive sets of squarefree integers
On primitive sets of suarefree integers R. Ahlswede and L. Khachatrian Fakultät für Mathematik Universität Bielefeld Postfach 003 3350 Bielefeld and A. Sárközy * Eötvös Loránd University Department of
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationMORE ON CONTINUOUS FUNCTIONS AND SETS
Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationPowers of 2 with five distinct summands
ACTA ARITHMETICA * (200*) Powers of 2 with five distinct summands by Vsevolod F. Lev (Haifa) 0. Summary. We show that every sufficiently large, finite set of positive integers of density larger than 1/3
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationChapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011)
Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011) Before we consider Gelfond s, and then Schneider s, complete solutions to Hilbert s seventh problem let s look back
More informationMATH 614 Dynamical Systems and Chaos Lecture 3: Classification of fixed points.
MATH 614 Dynamical Systems and Chaos Lecture 3: Classification of fixed points. Periodic points Definition. A point x X is called a fixed point of a map f : X X if f(x) = x. A point x X is called a periodic
More informationHOMEWORK ASSIGNMENT 6
HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly
More informationCHARACTERISTIC POLYNOMIAL PATTERNS IN DIFFERENCE SETS OF MATRICES
CHARACTERISTIC POLYNOMIAL PATTERNS IN DIFFERENCE SETS OF MATRICES MICHAEL BJÖRKLUND AND ALEXANDER FISH Abstract. We show that for every subset E of positive density in the set of integer squarematrices
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationarxiv: v4 [math.ds] 15 Jun 2017
SPHERICAL RECURRENCE AND LOCALLY ISOMETRIC EMBEDDINGS OF TREES INTO POSITIVE DENSITY SUBSETS OF Z d KAMIL BULINSKI School of Mathematics and Statistics F07, University of Sydney, NSW 006, Australia arxiv:1606.07596v4
More information(q 1)p q. = 1 (p 1)(q 1).
altic Way 001 Hamburg, November 4, 001 Problems 1. set of 8 problems was prepared for an examination. Each student was given 3 of them. No two students received more than one common problem. What is the
More informationA lattice point problem and additive number theory
A lattice point problem and additive number theory Noga Alon and Moshe Dubiner Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract
More informationOn the Prime Divisors of Odd Perfect Numbers
On the Prime Divisors of Odd Perfect Numbers Justin Sweeney Department of Mathematics Trinity College Hartford, CT justin.sweeney@trincoll.edu April 27, 2009 1 Contents 1 History of Perfect Numbers 5 2
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationMA651 Topology. Lecture 9. Compactness 2.
MA651 Topology. Lecture 9. Compactness 2. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationFollow links Class Use and other Permissions. For more information, send to:
COPYRIGHT OTICE: Steven J. Miller and Ramin Takloo-Bighash: An Invitation to Modern umber Theory is published by Princeton University Press and copyrighted, 2006, by Princeton University Press. All rights
More informationArithmetic progressions and the primes
Collect. Math. (2006), 37 88 Proceedings of the 7th International Conference on Harmonic Analysis and Partial Differential Equations El Escorial, Madrid (Spain), June 21-25, 2004 c 2006 Universitat de
More informationClassification of Finite Fields
Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationA Generating-Function Approach for Reciprocity Formulae of Dedekind-like Sums
A Generating-Function Approach for Reciprocity Formulae of Dedekind-like Sums Jordan Clark Morehouse College Stefan Klajbor University of Puerto Rico, Rio Piedras Chelsie Norton Valdosta State July 28,
More informationSubset sums modulo a prime
ACTA ARITHMETICA 131.4 (2008) Subset sums modulo a prime by Hoi H. Nguyen, Endre Szemerédi and Van H. Vu (Piscataway, NJ) 1. Introduction. Let G be an additive group and A be a subset of G. We denote by
More informationApproximation exponents for algebraic functions in positive characteristic
ACTA ARITHMETICA LX.4 (1992) Approximation exponents for algebraic functions in positive characteristic by Bernard de Mathan (Talence) In this paper, we study rational approximations for algebraic functions
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationREGULI AND APPLICATIONS, ZARANKIEWICZ PROBLEM
REGULI AN APPLICATIONS, ZARANKIEWICZ PROBLEM One of our long-term goals is to pursue some questions of incidence geometry in R 3. We recall one question to direct our focus during this lecture. Question
More informationMATH 426, TOPOLOGY. p 1.
MATH 426, TOPOLOGY THE p-norms In this document we assume an extended real line, where is an element greater than all real numbers; the interval notation [1, ] will be used to mean [1, ) { }. 1. THE p
More informationOn the number of elements with maximal order in the multiplicative group modulo n
ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer
More informationarxiv: v1 [math.mg] 10 Feb 2017
Rainbow triangles arxiv:1702.03043v1 [math.mg] 10 Feb 2017 Steven Senger February 9, 2017 Abstract We seek conditions under which colorings of various vector spaces are guaranteed to have a copy of a unit
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationSequences of height 1 primes in Z[X]
Sequences of height 1 primes in Z[X] Stephen McAdam Department of Mathematics University of Texas Austin TX 78712 mcadam@math.utexas.edu Abstract: For each partition J K of {1, 2,, n} (n 2) with J 2, let
More informationSolutions to Tutorial 8 (Week 9)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/
More information1 Homework. Recommended Reading:
Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis
More informationORTHOGONAL EXPONENTIALS, DIFFERENCE SETS, AND ARITHMETIC COMBINATORICS
ORTHOGONAL EXPONENTIALS, DIFFERENCE SETS, AND ARITHMETIC COMBINATORICS ALEX IOSEVICH & PHILIPPE JAMING Abstract. We prove that if A is a set of exponentials mutually orthogonal with respect to any symmetric
More informationGallai-Ramsey numbers for a class of graphs with five vertices arxiv: v1 [math.co] 15 Nov 2018
Gallai-Ramsey numbers for a class of graphs with five vertices arxiv:1811.06134v1 [math.co] 15 Nov 018 Xihe Li a,b and Ligong Wang a,b, a Department of Applied Mathematics, School of Science, Northwestern
More informationCombinatorial Optimization
Combinatorial Optimization 2017-2018 1 Maximum matching on bipartite graphs Given a graph G = (V, E), find a maximum cardinal matching. 1.1 Direct algorithms Theorem 1.1 (Petersen, 1891) A matching M is
More information