Sums, Products, and Rectangles
|
|
- Isabella Baldwin
- 5 years ago
- Views:
Transcription
1 July 11, 2012
2 Joint work in progress with Victor Lie, Princeton.
3 Table of contents 1 Sums and Products 2 3 4
4 Preliminary definitions We consider sets of real numbers. Now: A is a *finite* set Later: A is a δ-neighborhood of a finite set Definition A + A = {a + b : a, b A} AA = {ab : a, b A}
5 Basic Observations A A + A A 2 A + A is (essentially) minimized when A is (essentially) an arithmetic progression
6 Basic Observations A A + A A 2 A + A is (essentially) minimized when A is (essentially) an arithmetic progression A AA A 2 AA is (essentially) minimized when A is (essentially) a geometric progression
7 Basic Observations A A + A A 2 A + A is (essentially) minimized when A is (essentially) an arithmetic progression A AA A 2 AA is (essentially) minimized when A is (essentially) a geometric progression Sum-product phenomenon: These things cannot happen simultaneously
8 A more precise statement Theorem (Erdös-Szemeredi, Nathanson,..., Elekes, Solymosi,...?? ) If A R, then World Record β = 3 11 A + A + AA A 1+β.
9 A more precise statement Theorem (Erdös-Szemeredi, Nathanson,..., Elekes, Solymosi,...?? ) If A R, then A + A + AA A 1+β. World Record β = 3 11 Freiman-type theorems are not effective when the doubling is A A ɛ, so the heuristic on the previous page is difficult to use
10 A slightly different problem sum-product theorem A + AA is large
11 A slightly different problem sum-product theorem A + AA is large blah blah blah about passing to a large subset, etc. The formuation with A + AA is more closely tied to the part of the talk Definition A + AA = {a + bc : a, b, c A}
12 Encoding sums-products as points-lines Michael Bateman, UCLA Figure \ Cambridge : (a, b) Sums, Products, l and Given a pair (a, b) A A, we have a line l a,b given by y = ax + b. This gives us A A set of lines: L = {l a,b : a, b A}.
13 Incidence theory (Szemeredi-Trotter) = A + xa large for typical x A = A + AA large Figure : P = Black Red
14 Szemeredi-Trotter Let P be a set of points in the plane, and let L be a set of lines in the plane. Write I (P, L) to denote the number of incidences between P and L: I (P, L) = #{(p, l) P L: p l}. Theorem Suppose P = L = N. Then I (P, L) N 4 3.
15 2-D Kakeya R is a collection of δ 1 rectangles.
16 2-D Kakeya R is a collection of δ 1 rectangles. m R is the multiplicity function (DRAW PICTURE FOR AUDIENCE)
17 2-D Kakeya R is a collection of δ 1 rectangles. m R is the multiplicity function (DRAW PICTURE FOR AUDIENCE) Theorem {m R > λ} m R 2 2 λ 2 log #R m R 1 λ 2.
18 2-D Kakeya R is a collection of δ 1 rectangles. m R is the multiplicity function (DRAW PICTURE FOR AUDIENCE) Theorem {m R > λ} m R 2 2 λ 2 log #R m R 1 λ 2. L 2 controlled by L 1 means not too much pile-up
19 2-D Kakeya R is a collection of δ 1 rectangles. m R is the multiplicity function (DRAW PICTURE FOR AUDIENCE) Theorem {m R > λ} m R 2 2 λ 2 log #R m R 1 λ 2. L 2 controlled by L 1 means not too much pile-up L 2 estimate (due to Cordoba) esablished by variant of 2 lines 1 point argument
20 2-D Kakeya R is a collection of δ 1 rectangles. m R is the multiplicity function (DRAW PICTURE FOR AUDIENCE) Theorem {m R > λ} m R 2 2 λ 2 log #R m R 1 λ 2. L 2 controlled by L 1 means not too much pile-up L 2 estimate (due to Cordoba) esablished by variant of 2 lines 1 point argument
21 Sums and Products Radial example Figure : {mr > λ} = lower left corner
22 Where is m R large? Upper bound on {m R > λ} cannot be improved without further hypothesis
23 Where is m R large? Upper bound on {m R > λ} cannot be improved without further hypothesis If upper bound is sharp, what can be said about structure of {m R > λ}?
24 Where is m R large? Always Upper bound on {m R > λ} cannot be improved without further hypothesis If upper bound is sharp, what can be said about structure of {m R > λ}? {m R > λ} 1 λ 2 CONJECTURE If {m R > λ} is not essentially concentrated in a ball, then {m R > λ} 1 λ 2+ɛ
25 Figure : Cantor-Kakeya set
26 Digression on Motivation Bounds on the maximal Schoedinger operator can be reduced to geometric questions of this form (Geometric result implies Fourier analytic result)
27 Digression on Motivation Bounds on the maximal Schoedinger operator can be reduced to geometric questions of this form (Geometric result implies Fourier analytic result) Consider a set E containing an α-dimensional set in each direction. How big is dimension of E? (Furstenberg conjecture)
28 Digression on Motivation Bounds on the maximal Schoedinger operator can be reduced to geometric questions of this form (Geometric result implies Fourier analytic result) Consider a set E containing an α-dimensional set in each direction. How big is dimension of E? (Furstenberg conjecture) Lip-service to Kakeya problem(s) (Transversality vs Non-transversality)
29 Why should the conjecture be true? Simple case: Suppose the set {m R > λ} looks like a lattice with substantial separation? Conjecture is true here Szemeredi-Trotter style arguments work
30 Toward sum-product Let P be the collection of δ δ squares forming {m R > λ}
31 Toward sum-product Let P be the collection of δ δ squares forming {m R > λ} These δ δ squares are now the points Incidence theorem for P, R implies estimate on {m R > λ}
32 Toward sum-product Let P be the collection of δ δ squares forming {m R > λ} These δ δ squares are now the points Incidence theorem for P, R implies estimate on {m R > λ} What can we say when points in P have some separation?
33 Toward sum-product Let P be the collection of δ δ squares forming {m R > λ} These δ δ squares are now the points Incidence theorem for P, R implies estimate on {m R > λ} What can we say when points in P have some separation? CONJECTURE If {m R > λ} is not essentially concentrated in a ball, then {m R > λ} 1 λ 2+ɛ
34 Simplifying assumptions What if we assume the rectangles arise from pairs (a, b) A A?
35 Simplifying assumptions What if we assume the rectangles arise from pairs (a, b) A A? What if we additionally assume each point in P projects to A?
36 Simplifying assumptions What if we assume the rectangles arise from pairs (a, b) A A? What if we additionally assume each point in P projects to A? Counting incidences is like estimating A + AA, or more precisely, E x A A + xa
37 Simplifying assumptions What if we assume the rectangles arise from pairs (a, b) A A? What if we additionally assume each point in P projects to A? Counting incidences is like estimating A + AA, or more precisely, E x A A + xa
38 These are rectangles this time Figure : Incidences and sum-product
39 Theorem (Bourgain) if A has dimension 1 2. In fact #(A + AA) is large #(A + A) + #(AA) (#A) 1+ɛ #(A + xa) is large for a typical x A Bourgan proves the theorem for α (0, 1), with ɛ = ɛ(α) α 2 Probably ɛ(α) α, which is the correct numerology.
40 Why can t we appeal to classical sum-product theory? A naive approach might be to model intervals by their centers C, apply sum-product theory to this set C, then unwind Figure : Few δ-intervals, many distinct points
41 Difference in incidence approach for lines... Figure : Two lines intersect in one point
42 ... Sums and Products Figure : Transverse intersection
43 ... and that for rectangles Figure : Non-transverse intersection
44 Why should Bourgain s theorem be true? Consider a further special case: A is a genuine arithmetic progression with substantial separation between the intervals Slopes of tubes come from A, hence if slopes are different then they are very different Separation of slopes is almost-transversality
45 Further comments Again, Freiman s theorem is too weak Bourgain uses a multiscale analysis of the set A, and applies Freiman at each level Key simplification for Bourgain: product structure of rectangles and points Without product structure: separation of points (which we assume) is essentially dual condition to separation of slopes (which we know is helpful)
SZEMERÉDI-TROTTER INCIDENCE THEOREM AND APPLICATIONS
SZEMERÉDI-TROTTER INCIDENCE THEOREM AND APPLICATIONS PAUL H. KOESTER Given a finite set of points P R 2 and a finite family of lines L, we define the set of incidences of P and L by I(P, L) = {(p, l) P
More informationFINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures)
FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures) Ana Zumalacárregui a.zumalacarregui@unsw.edu.au November 30, 2015 Contents 1 Operations on sets 1 2 Sum-product theorem
More informationA SUM-PRODUCT ESTIMATE IN ALGEBRAIC DIVISION ALGEBRAS OVER R. Department of Mathematics University of California Riverside, CA
A SUM-PRODUCT ESTIMATE IN ALGEBRAIC DIVISION ALGEBRAS OVER R 1 Mei-Chu Chang Department of Mathematics University of California Riverside, CA 951 mcc@math.ucr.edu Let A be a finite subset of an integral
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 information#A34 INTEGERS 13 (2013) A NOTE ON THE MULTIPLICATIVE STRUCTURE OF AN ADDITIVELY SHIFTED PRODUCT SET AA + 1
#A34 INTEGERS 13 (2013) A NOTE ON THE MULTIPLICATIVE STRUCTURE OF AN ADDITIVELY SHIFTED PRODUCT SET AA + 1 Steven Senger Department of Mathematics, University of Delaware, Newark, Deleware senger@math.udel.edu
More informationThe Kakeya Problem Connections with Harmonic Analysis Kakeya sets over Finite Fields. Kakeya Sets. Jonathan Hickman. The University of Edinburgh
The University of Edinburgh The Kakeya Problem Definition A Kakeya set K R n is a compact subset which contains a unit line segment in every direction. The Kakeya Problem Examples of Kakeya subsets of
More informationThe discrete Fourier restriction phenomenon: the non-lattice case
The discrete Fourier restriction phenomenon: the non-lattice case November 2, 2013 Let S n 1 be the sphere of radius 1 in R n and let P n 1 = {(x 1,...,x n 1,x 2 1 +...x2 n 1 ) : 1 x i 1} be the truncated
More informationDecouplings and applications
April 27, 2018 Let Ξ be a collection of frequency points ξ on some curved, compact manifold S of diameter 1 in R n (e.g. the unit sphere S n 1 ) Let B R = B(c, R) be a ball with radius R 1. Let also a
More informationGROWTH IN GROUPS I: SUM-PRODUCT. 1. A first look at growth Throughout these notes A is a finite set in a ring R. For n Z + Define
GROWTH IN GROUPS I: SUM-PRODUCT NICK GILL 1. A first look at growth Throughout these notes A is a finite set in a ring R. For n Z + Define } A + {{ + A } = {a 1 + + a n a 1,..., a n A}; n A } {{ A} = {a
More informationResearch Problems in Arithmetic Combinatorics
Research Problems in Arithmetic Combinatorics Ernie Croot July 13, 2006 1. (related to a quesiton of J. Bourgain) Classify all polynomials f(x, y) Z[x, y] which have the following property: There exists
More informationErdős and arithmetic progressions
Erdős and arithmetic progressions W. T. Gowers University of Cambridge July 2, 2013 W. T. Gowers (University of Cambridge) Erdős and arithmetic progressions July 2, 2013 1 / 22 Two famous Erdős conjectures
More informationarxiv: v3 [math.co] 23 Jun 2008
BOUNDING MULTIPLICATIVE ENERGY BY THE SUMSET arxiv:0806.1040v3 [math.co] 23 Jun 2008 Abstract. We prove that the sumset or the productset of any finite set of real numbers, A, is at least A 4/3 ε, improving
More informationarxiv: v1 [math.co] 25 Oct 2018
AN IMPROVED BOUND FOR THE SIZE OF THE SET A/A+A OLIVER ROCHE-NEWTON arxiv:1810.10846v1 [math.co] 25 Oct 2018 Abstract. It is established that for any finite set of positive real numbers A, we have A/A+A
More informationTHE KAKEYA SET CONJECTURE IS TRUE
THE KAKEYA SET CONJECTURE IS TRUE J.ASPEGREN Abstract. In this article we will prove the Kakeya set conjecture. In addition we will prove that in the usual approach to the Kakeya maximal function conjecture
More informationarxiv:math/ v3 [math.co] 15 Oct 2006
arxiv:math/060946v3 [math.co] 15 Oct 006 and SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds
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 informationDepartment of Mathematics University of California Riverside, CA
SOME PROBLEMS IN COMBINATORIAL NUMBER THEORY 1 Mei-Chu Chang Department of Mathematics University of California Riverside, CA 92521 mcc@math.ucr.edu dedicated to Mel Nathanson on his 60th birthday Abstract
More informationSzemerédi-Trotter theorem and applications
Szemerédi-Trotter theorem and applications M. Rudnev December 6, 2004 The theorem Abstract These notes cover the material of two Applied post-graduate lectures in Bristol, 2004. Szemerédi-Trotter theorem
More informationUNIONS OF LINES IN F n
UNIONS OF LINES IN F n RICHARD OBERLIN Abstract. We show that if a collection of lines in a vector space over a finite field has dimension at least 2(d 1)+β, then its union has dimension at least d + β.
More informationCollinearities in Kinetic Point Sets
Collinearities in Kinetic Point Sets Ben Lund 1 George Purdy 1 Justin Smith 1 Csaba Tóth 2 1 Department of Computer Science 2 Department of Mathematics University of Cincinnati University of Calgary k-collinearities
More informationON THE KAKEYA SET CONJECTURE
ON THE KAKEYA SET CONJECTURE J.ASPEGREN Abstract. In this article we will prove the Kakeya set conjecture. In addition we will prove that in the usual approach to the Kakeya maximal function conjecture
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 informationMei-Chu Chang Department of Mathematics University of California Riverside, CA 92521
ERDŐS-SZEMERÉDI PROBLEM ON SUM SET AND PRODUCT SET Mei-Chu Chang Department of Mathematics University of California Riverside, CA 951 Summary. The basic theme of this paper is the fact that if A is a finite
More informationthrough any three given points if and only if these points are not collinear.
Discover Parabola Time required 45 minutes Teaching Goals: 1. Students verify that a unique parabola with the equation y = ax + bx+ c, a 0, exists through any three given points if and only if these points
More informationPolynomial Wolff axioms and Kakeya-type estimates for bent tubes
Polynomial Wolff axioms and Kakeya-type estimates for bent tubes Mentor: Robert Burklund Liberal Arts and Science Academy May 20, 2018 MIT PRIMES Conference Background How big is the volume of the union
More informationA course on sum-product bounds
A course on sum-product bounds Frank de Zeeuw May 29, 2017 1 Sum-product bounds in R 2 1.1 Introduction...................................... 2 1.2 The Erdős-Szemerédi Theorem...........................
More informationON A PROBLEM RELATED TO SPHERE AND CIRCLE PACKING
ON A PROBLEM RELATED TO SPHERE AND CIRCLE PACKING THEMIS MITSIS ABSTRACT We prove that a set which contains spheres centered at all points of a set of Hausdorff dimension greater than must have positive
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA. Dartmouth Mathematics Society May 16, 2012
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Dartmouth Mathematics Society May 16, 2012 Based on joint work with P. Kurlberg, J. C. Lagarias, & A. Schinzel Let s begin
More informationHOW TO LOOK AT MINKOWSKI S THEOREM
HOW TO LOOK AT MINKOWSKI S THEOREM COSMIN POHOATA Abstract. In this paper we will discuss a few ways of thinking about Minkowski s lattice point theorem. The Minkowski s Lattice Point Theorem essentially
More informationResearch in Mathematical Analysis Some Concrete Directions
Research in Mathematical Analysis Some Concrete Directions Anthony Carbery School of Mathematics University of Edinburgh Prospects in Mathematics, Durham, 9th January 2009 Anthony Carbery (U. of Edinburgh)
More informationFrom cutting pancakes to Szemeredi-Trotter (and Ham Sandwiches too)
From cutting pancakes to Szemeredi-Trotter (and Ham Sandwiches too) Po-Lam Yung March 14, 2017 How would you cut the following pancake into two equal halves using a knife (a straight line)? (Throughout
More informationModel-theoretic distality and incidence combinatorics
Model-theoretic distality and incidence combinatorics Artem Chernikov UCLA Model Theory and Combinatorics workshop IHP, Paris, France Jan 29, 2018 Intro I will discuss generalizations of various results
More informationFROM HARMONIC ANALYSIS TO ARITHMETIC COMBINATORICS: A BRIEF SURVEY
FROM HARMONIC ANALYSIS TO ARITHMETIC COMBINATORICS: A BRIEF SURVEY IZABELLA LABA The purpose of this note is to showcase a certain line of research that connects harmonic analysis, specifically restriction
More informationMULTIFOLD SUMS AND PRODUCTS OVER R, AND COMBINATORIAL PROBLEMS ON SUMSETS
MULTIFOLD SUMS AND PRODUCTS OVER R, AND COMBINATORIAL PROBLEMS ON SUMSETS A Thesis Presented to The Academic Faculty by Albert Bush In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy
More informationFOURIER ANALYSIS AND GEOMETRIC COMBINATORICS
FOURIER ANALYSIS AND GEOMETRIC COMBINATORICS Alex Iosevich Department of Mathematics University of Missouri-Columbia Columbia, MO 65211 USA iosevich@math.missouri.edu Abstract This article is based on
More informationTaylor polynomials. 1. Introduction. 2. Linear approximation.
ucsc supplementary notes ams/econ 11a Taylor polynomials c 01 Yonatan Katznelson 1. Introduction The most elementary functions are polynomials because they involve only the most basic arithmetic operations
More informationAdditive Combinatorics and Szemerédi s Regularity Lemma
Additive Combinatorics and Szemerédi s Regularity Lemma Vijay Keswani Anurag Sahay 20th April, 2015 Supervised by : Dr. Rajat Mittal 1 Contents 1 Introduction 3 2 Sum-set Estimates 4 2.1 Size of sumset
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 informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA International Number Theory Conference in Memory of Alf van der Poorten, AM 12 16 March, 2012 CARMA, the University of Newcastle
More information1. Introduction RECENT PROGRESS ON THE KAKEYA CONJECTURE. Nets Katz and Terence Tao. Abstract
Publ. Mat. (2002), 161 179 Proceedings of the 6 th International Conference on Harmonic Analysis and Partial Differential Equations. El Escorial, 2000. RECENT PROGRESS ON THE KAKEYA CONJECTURE Nets Katz
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA. Providence College Math/CS Colloquium April 2, 2014
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Providence College Math/CS Colloquium April 2, 2014 Let s begin with products. Take the N N multiplication table. It has
More informationGeneralized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv: v2 [math.
Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv:0801.0728v2 [math.co] 31 Mar 2008 David Covert, Derrick Hart, Alex Iosevich, Doowon Koh, and Misha Rudnev
More informationSums and products: What we still don t know about addition and multiplication
Sums and products: What we still don t know about addition and multiplication Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Based on joint work with R. P. Brent, P. Kurlberg, J. C. Lagarias,
More informationApplications of model theory in extremal graph combinatorics
Applications of model theory in extremal graph combinatorics Artem Chernikov (IMJ-PRG, UCLA) Logic Colloquium Helsinki, August 4, 2015 Szemerédi regularity lemma Theorem [E. Szemerédi, 1975] Every large
More informationWorkshop on Discrete Harmonic Analysis Newton Institute, March 2011
High frequency criteria for Boolean functions (with an application to percolation) Christophe Garban ENS Lyon and CNRS Workshop on Discrete Harmonic Analysis Newton Institute, March 2011 C. Garban (ENS
More informationWHY POLYNOMIALS? PART 1
WHY POLYNOMIALS? PART 1 The proofs of finite field Kakeya and joints and short and clean, but they also seem strange to me. They seem a little like magic tricks. In particular, what is the role of polynomials
More informationA survey on l 2 decoupling
A survey on l 2 decoupling Po-Lam Yung 1 The Chinese University of Hong Kong January 31, 2018 1 Research partially supported by HKRGC grant 14313716, and by CUHK direct grants 4053220, 4441563 Introduction
More informationSystems of Linear Equations
Systems of Linear Equations Linear Algebra MATH 2076 Linear Algebra SLEs Chapter 1 Section 1 1 / 8 Linear Equations and their Solutions A linear equation in unknowns (the variables) x 1, x 2,..., x n has
More informationWhat we still don t know about addition and multiplication. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
What we still don t know about addition and multiplication Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA You would think that all of the issues surrounding addition and multiplication were
More informationSum-product estimates over arbitrary finite fields
Sum-product estimates over arbitrary finite fields Doowon Koh Sujin Lee Thang Pham Chun-Yen Shen Abstract arxiv:1805.08910v3 [math.nt] 16 Jul 2018 In this paper we prove some results on sum-product estimates
More informationThe polynomial method in combinatorics
AMS joint meetings 4 January 2012 Overview In the last five years, several challenging problems in combinatorics have been solved by introducing polynomials into the problem in an unexpected way. This
More informationMid Term-1 : Practice problems
Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to
More informationHarmonic Analysis and Additive Combinatorics on Fractals
Harmonic Analysis and Additive Combinatorics on Fractals Etta Z. Falconer Lecture Mathfest, 2016 Fractals: random vs. structured Example: Ternary Cantor set Dimension (similarity and Hausdorff) log 2 log
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 informationThree-variable expanding polynomials and higher-dimensional distinct distances
Three-variable expanding polynomials and higher-dimensional distinct distances Thang Pham Le Anh Vinh Frank de Zeeuw arxiv:1612.09032v3 [math.co] 24 Feb 2017 Abstract We determine which quadratic polynomials
More informationGroup actions, the Mattila integral and continuous sum-product problems
Group actions, the Mattila integral and continuous sum-product problems Bochen Liu University of Rochester Acknowledgment: This work is done when the author was a research assistant in the Chinese University
More informationWalk through Combinatorics: Sumset inequalities.
Walk through Combinatorics: Sumset inequalities (Version 2b: revised 29 May 2018) The aim of additive combinatorics If A and B are two non-empty sets of numbers, their sumset is the set A+B def = {a+b
More information5.4 Continuity: Preliminary Notions
5.4. CONTINUITY: PRELIMINARY NOTIONS 181 5.4 Continuity: Preliminary Notions 5.4.1 Definitions The American Heritage Dictionary of the English Language defines continuity as an uninterrupted succession,
More informationSum-Product Type Estimates for Subsets of Finite Valuation Rings arxiv: v1 [math.co] 27 Jan 2017
Sum-Product Type Estimates for Subsets of Finite Valuation Rings arxiv:70.080v [math.co] 27 Jan 207 Esen Aksoy Yazici September 9, 208 Abstract Let R be a finite valuation ring of order q r. Using a point-plane
More informationSmall ball inequalities in analysis, probability, and irregularities of distribution
Small ball inequalities in analysis, probability, and irregularities of distribution organized by William Chen, Michael Lacey, Mikhail Lifshits, and Jill Pipher Workshop Summary This workshop had researchers
More informationSelected Results in Additive Combinatorics: An Exposition
Electronic Colloquium on Computational Complexity, Report No. 103 (2007) Selected Results in Additive Combinatorics: An Exposition Emanuele Viola September 27, 2007 Abstract We give a self-contained exposition
More informationGLOSSARY TERM DEFINITIONS
Course: 1205080 M/J Mathematics 3, Advanced RELATED GLOSSARY TERM DEFINITIONS (79) Absolute value: Algebraic expression: Angle: Approximate: Area: Benchmark: Central tendency: Congruent: Continuous data:
More informationLinear Algebra, Summer 2011, pt. 2
Linear Algebra, Summer 2, pt. 2 June 8, 2 Contents Inverses. 2 Vector Spaces. 3 2. Examples of vector spaces..................... 3 2.2 The column space......................... 6 2.3 The null space...........................
More informationIntroduction: Pythagorean Triplets
Introduction: Pythagorean Triplets On this first day I want to give you an idea of what sorts of things we talk about in number theory. In number theory we want to study the natural numbers, and in particular
More informationFrom Rotating Needles to Stability of Waves:
From otating Needles to Stability of Waves: Emerging Connections between Combinatorics, Analysis, and PDE erence ao Introduction In 1917 S. Kakeya posed the Kakeya needle problem: What is the smallest
More informationPermutation Groups and Transformation Semigroups Lecture 2: Semigroups
Permutation Groups and Transformation Semigroups Lecture 2: Semigroups Peter J. Cameron Permutation Groups summer school, Marienheide 18 22 September 2017 I am assuming that you know what a group is, but
More informationChapter 4: Constant-degree Polynomial Partitioning
Chapter 4: Constant-degree Polynomial Partitioning Adam Sheffer May 1, 2015 In this chapter we present a different way of deriving incidence bounds by using polynomial partitioning. This method yields
More informationAlgebra and Trigonometry 2006 (Foerster) Correlated to: Washington Mathematics Standards, Algebra 2 (2008)
A2.1. Core Content: Solving problems The first core content area highlights the type of problems students will be able to solve by the end of, as they extend their ability to solve problems with additional
More informationarxiv: v2 [math.ca] 11 Aug 2014
A DISCRETISED PROJECTION THEOREM IN THE PLANE TUOMAS ORPONEN arxiv:1407.6543v2 [math.ca] 11 Aug 2014 ABSTRACT. The main result of this paper is that for any 1/2 s < 2 2 0.5858, there is a number σ = σ(s)
More informationCauchy-Schwartz inequality and geometric incidence problems. Misha Rudnev
Cauchy-Schwart inequality and geometric incidence problems Misha Rudnev Abstract In this lecture, I will discuss a couple of examples showing what a nice way of bookkeeping the Cauchy-Schwart inequality
More informationSum-Product Problem: New Generalisations and Applications
Sum-Product Problem: New Generalisations and Applications Igor E. Shparlinski Macquarie University ENS, Chaire France Telecom pour la sécurité des réseaux de télécommunications igor@comp.mq.edu.au 1 Background
More informationThe Fourier transform and Hausdorff dimension. Pertti Mattila. Pertti Mattila. University of Helsinki. Sant Feliu de Guíxols June 15 18, 2015
University of Helsinki Sant Feliu de Guíxols June 15 18, 2015 The s-al measure H s, s 0, is defined by H s (A) = lim δ 0 H s δ (A), where, for 0 < δ, H s δ (A) = inf{ j d(e j ) s : A j E j, d(e j ) < δ}.
More informationAdditive Combinatorics and Computational Complexity
Additive Combinatorics and Computational Complexity Luca Trevisan U.C. Berkeley Ongoing joint work with Omer Reingold, Madhur Tulsiani, Salil Vadhan Combinatorics: Studies: Graphs, hypergraphs, set systems
More informationAlgebra 1 Correlation of the ALEKS course Algebra 1 to the Washington Algebra 1 Standards
Algebra 1 Correlation of the ALEKS course Algebra 1 to the Washington Algebra 1 Standards A1.1: Core Content: Solving Problems A1.1.A: Select and justify functions and equations to model and solve problems.
More informationA PROBABILISTIC PROOF OF THE VITALI COVERING LEMMA
A PROBABILISTIC PROOF OF THE VITALI COVERING LEMMA E. GWALTNEY, P. HAGELSTEIN, AND D. HERDEN Abstract. The classical Vitali Covering Lemma on R states that there exists a constant c > 0 such that, given
More informationPOISSON PROCESSES 1. THE LAW OF SMALL NUMBERS
POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS 1.1. The Rutherford-Chadwick-Ellis Experiment. About 90 years ago Ernest Rutherford and his collaborators at the Cavendish Laboratory in Cambridge conducted
More informationHigher-Dimensional Analogues of the Combinatorial Nullstellensatz
Higher-Dimensional Analogues of the Combinatorial Nullstellensatz Jake Mundo July 21, 2016 Abstract The celebrated Combinatorial Nullstellensatz of Alon describes the form of a polynomial which vanishes
More informationEfficient packing of unit squares in a square
Loughborough University Institutional Repository Efficient packing of unit squares in a square This item was submitted to Loughborough University's Institutional Repository by the/an author. Additional
More informationDiffraction by Edges. András Vasy (with Richard Melrose and Jared Wunsch)
Diffraction by Edges András Vasy (with Richard Melrose and Jared Wunsch) Cambridge, July 2006 Consider the wave equation Pu = 0, Pu = D 2 t u gu, on manifolds with corners M; here g 0 the Laplacian, D
More informationSome unsolved problems in additive/combinatorial number theory. W. T. Gowers
Some unsolved problems in additive/combinatorial number theory. W. T. Gowers The following article is a small modification of the last part of a longer article based on two lectures given in the Harvard/MIT
More informationA Sharpened Hausdorff-Young Inequality
A Sharpened Hausdorff-Young Inequality Michael Christ University of California, Berkeley IPAM Workshop Kakeya Problem, Restriction Problem, Sum-Product Theory and perhaps more May 5, 2014 Hausdorff-Young
More informationDisproving Conjectures with Counterexamples
Disproving Conjectures with Counterexamples Consider the simple conjecture given below. If two lines are both intersected by a transversal, then they are parallel. This conjecture is false: two lines do
More informationGeneralized Pythagoras Theorem
Generalized Pythagoras Theorem The Pythagoras theorem came from India through Arab mathematicians to the Greeks. It claims that if we draw squares on the sides of a right angle triangle, then the two smaller
More informationINTEGERS CONFERENCE 2013: ERDŐS CENTENNIAL
INTEGERS CONFERENCE 2013: ERDŐS CENTENNIAL (joint work with Mits Kobayashi) University of Georgia October 24, 2013 1 / 22 All Greek to us 2 / 22 Among simple even, some are super, others are deficient:
More informationDistinct distances between points and lines in F 2 q
Distinct distances between points and lines in F 2 q Thang Pham Nguyen Duy Phuong Nguyen Minh Sang Claudiu Valculescu Le Anh Vinh Abstract In this paper we give a result on the number of distinct distances
More informationLECTURE NOTES ON THE FOURIER TRANSFORM AND HAUSDORFF DIMENSION
LECTURE NOTES ON THE FOURIER TRANSFORM AND HAUSDORFF DIMENSION PERTTI MATTILA Buenos Aires August 1 3, 2015 Most of these lectures are based on the book P. Mattila: The Fourier transform and Hausdorff
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 3: Linear Programming, Continued Prof. John Gunnar Carlsson September 15, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 15, 2010
More informationInteger knapsacks and the Frobenius problem. Lenny Fukshansky Claremont McKenna College
Integer knapsacks and the Frobenius problem Lenny Fukshansky Claremont McKenna College Claremont Statistics, Operations Research, and Math Finance Seminar April 21, 2011 1 Integer knapsack problem Given
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationPrentice Hall Algebra 1, Foundations Series 2011 Correlated to: Washington Mathematics Standards, Algebra 1 (2008)
Algebra 1 A1.1. Core Content: Solving problems (Algebra) Students learn to solve many new types of problems in Algebra 1, and this first core content area highlights the types of problems students will
More informationIncidence Theory with a Focus on the Polynomial Method. Adam Sheffer
Incidence Theory with a Focus on the Polynomial Method Adam Sheffer This document is an incomplete draft from July 23, 2018. Several chapters are still missing. Acknowledgements This book would not have
More informationTHE CONVEX HULL OF THE PRIME NUMBER GRAPH
THE CONVEX HULL OF THE PRIME NUMBER GRAPH NATHAN MCNEW Abstract Let p n denote the n-th prime number, and consider the prime number graph, the collection of points n, p n in the plane Pomerance uses the
More informationA FINITE VERSION OF THE KAKEYA PROBLEM
A FINITE VERSION OF THE KAKEYA PROBLEM SIMEON BALL, AART BLOKHUIS, AND DIEGO DOMENZAIN Abstract. Let L be a set of lines of an affine space over a field and let S be a set of points with the property that
More informationfive line proofs Victor Ufnarovski, Frank Wikström 20 december 2016 Matematikcentrum, LTH
five line proofs Victor Ufnarovski, Frank Wikström 20 december 2016 Matematikcentrum, LTH projections The orthogonal projections of a body on two different planes are disks. Prove that they have the same
More informationCartesian products in combinatorial geometry
Cartesian products in combinatorial geometry Or: Why we are not yet done with Schwartz-Zippel Frank de Zeeuw EPFL, Switzerland Combinatorics Seminar at University of Bristol; IPAM reunion, Lake Arrowhead
More informationRecent work connected with the Kakeya problem. Thomas Wolff Department of Mathematics Caltech Pasadena, Ca USA
Recent work connected with the Kakeya problem Thomas Wolff Department of Mathematics 53-37 Caltech Pasadena, Ca 9115 USA wolff@cco.caltech.edu A Kakeya set in R n is a compact set E R n containing a unit
More informationGeometric Complexity and Applications CIS 6930 August 26 - September 4, Lecture 1 through 4
Geometric Complexity and Applications CIS 6930 August 26 - September 4, 2008 Lecture 1 through 4 Lecturer: Dr. Meera Sitharam Scribe: Venkatakrishnan Ramaswamy 1 Introduction Geometric Complexity is a
More informationASYMPTOTIC DIOPHANTINE APPROXIMATION: THE MULTIPLICATIVE CASE
ASYMPTOTIC DIOPHANTINE APPROXIMATION: THE MULTIPLICATIVE CASE MARTIN WIDMER ABSTRACT Let α and β be irrational real numbers and 0 < ε < 1/30 We prove a precise estimate for the number of positive integers
More informationEigenvalues and eigenfunctions of the Laplacian. Andrew Hassell
Eigenvalues and eigenfunctions of the Laplacian Andrew Hassell 1 2 The setting In this talk I will consider the Laplace operator,, on various geometric spaces M. Here, M will be either a bounded Euclidean
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 information