distribution of missing sums in sumsets...distribution of missing sums in sumsets oleg lazarev,...
TRANSCRIPT
![Page 1: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/1.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Distribution of Missing Sums in Sumsets
Oleg Lazarev, Princeton UniversityAdvisor: Steven Miller, Williams College
SMALL Research Program 2011, Williams College
2011 Young Mathematicians ConferenceThe Ohio State University, August 21, 2011
1
![Page 2: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/2.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Background
Let A ⊆ N ∪ {0}.
DefinitionSumset: A + A = {x + y : x , y ∈ A}Interval: [a,b] = {x ∈ N : a ≤ x ≤ b}
Example: if A = {1,2,5}, then
A + A = {2,3,4,6,7,10}
Why study sumsets?Goldbach’s conjecture: {4,6,8, · · · } ⊆ P + P.Fermat’s last theorem: let An be the nth powers and thenask if (An + An) ∩ An = ∅ for all n > 2.
Key Question: What is the structure of A + A?
2
![Page 3: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/3.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Background
Let A ⊆ N ∪ {0}.
DefinitionSumset: A + A = {x + y : x , y ∈ A}
Interval: [a,b] = {x ∈ N : a ≤ x ≤ b}
Example: if A = {1,2,5}, then
A + A = {2,3,4,6,7,10}
Why study sumsets?Goldbach’s conjecture: {4,6,8, · · · } ⊆ P + P.Fermat’s last theorem: let An be the nth powers and thenask if (An + An) ∩ An = ∅ for all n > 2.
Key Question: What is the structure of A + A?
3
![Page 4: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/4.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Background
Let A ⊆ N ∪ {0}.
DefinitionSumset: A + A = {x + y : x , y ∈ A}Interval: [a,b] = {x ∈ N : a ≤ x ≤ b}
Example: if A = {1,2,5}, then
A + A = {2,3,4,6,7,10}
Why study sumsets?Goldbach’s conjecture: {4,6,8, · · · } ⊆ P + P.Fermat’s last theorem: let An be the nth powers and thenask if (An + An) ∩ An = ∅ for all n > 2.
Key Question: What is the structure of A + A?
4
![Page 5: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/5.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Background
Let A ⊆ N ∪ {0}.
DefinitionSumset: A + A = {x + y : x , y ∈ A}Interval: [a,b] = {x ∈ N : a ≤ x ≤ b}
Example: if A = {1,2,5}, then
A + A = {2,3,4,6,7,10}
Why study sumsets?Goldbach’s conjecture: {4,6,8, · · · } ⊆ P + P.Fermat’s last theorem: let An be the nth powers and thenask if (An + An) ∩ An = ∅ for all n > 2.
Key Question: What is the structure of A + A?
5
![Page 6: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/6.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Background
Let A ⊆ N ∪ {0}.
DefinitionSumset: A + A = {x + y : x , y ∈ A}Interval: [a,b] = {x ∈ N : a ≤ x ≤ b}
Example: if A = {1,2,5}, then
A + A = {2,3,4,6,7,10}
Why study sumsets?
Goldbach’s conjecture: {4,6,8, · · · } ⊆ P + P.Fermat’s last theorem: let An be the nth powers and thenask if (An + An) ∩ An = ∅ for all n > 2.
Key Question: What is the structure of A + A?
6
![Page 7: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/7.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Background
Let A ⊆ N ∪ {0}.
DefinitionSumset: A + A = {x + y : x , y ∈ A}Interval: [a,b] = {x ∈ N : a ≤ x ≤ b}
Example: if A = {1,2,5}, then
A + A = {2,3,4,6,7,10}
Why study sumsets?Goldbach’s conjecture: {4,6,8, · · · } ⊆ P + P.
Fermat’s last theorem: let An be the nth powers and thenask if (An + An) ∩ An = ∅ for all n > 2.
Key Question: What is the structure of A + A?
7
![Page 8: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/8.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Background
Let A ⊆ N ∪ {0}.
DefinitionSumset: A + A = {x + y : x , y ∈ A}Interval: [a,b] = {x ∈ N : a ≤ x ≤ b}
Example: if A = {1,2,5}, then
A + A = {2,3,4,6,7,10}
Why study sumsets?Goldbach’s conjecture: {4,6,8, · · · } ⊆ P + P.Fermat’s last theorem: let An be the nth powers and thenask if (An + An) ∩ An = ∅ for all n > 2.
Key Question: What is the structure of A + A?
8
![Page 9: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/9.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Background
Let A ⊆ N ∪ {0}.
DefinitionSumset: A + A = {x + y : x , y ∈ A}Interval: [a,b] = {x ∈ N : a ≤ x ≤ b}
Example: if A = {1,2,5}, then
A + A = {2,3,4,6,7,10}
Why study sumsets?Goldbach’s conjecture: {4,6,8, · · · } ⊆ P + P.Fermat’s last theorem: let An be the nth powers and thenask if (An + An) ∩ An = ∅ for all n > 2.
Key Question: What is the structure of A + A?9
![Page 10: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/10.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets
Consider finite A ⊆ [0,n− 1] chosen randomly with uniformdistribution from all subsets of [0,n − 1].
Question: What is the structure of A + A for such A? whatthe distribution of |A + A| for such A?
Theorem: Martin, O’Bryant
E|A + A| = 2n − 1− 10 + O((3/4)n/2)
Theorem: ZhaoFor each fixed k , P(A ⊆ [0,n − 1] : |A + A| = 2n − 1− k) has alimit as n→∞
Note: Both theorem can be more naturally stated in terms ofmissing sums (independent of n).
10
![Page 11: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/11.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets
Consider finite A ⊆ [0,n− 1] chosen randomly with uniformdistribution from all subsets of [0,n − 1].Question: What is the structure of A + A for such A? whatthe distribution of |A + A| for such A?
Theorem: Martin, O’Bryant
E|A + A| = 2n − 1− 10 + O((3/4)n/2)
Theorem: ZhaoFor each fixed k , P(A ⊆ [0,n − 1] : |A + A| = 2n − 1− k) has alimit as n→∞
Note: Both theorem can be more naturally stated in terms ofmissing sums (independent of n).
11
![Page 12: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/12.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets
Consider finite A ⊆ [0,n− 1] chosen randomly with uniformdistribution from all subsets of [0,n − 1].Question: What is the structure of A + A for such A? whatthe distribution of |A + A| for such A?
Theorem: Martin, O’Bryant
E|A + A| = 2n − 1− 10 + O((3/4)n/2)
Theorem: ZhaoFor each fixed k , P(A ⊆ [0,n − 1] : |A + A| = 2n − 1− k) has alimit as n→∞
Note: Both theorem can be more naturally stated in terms ofmissing sums (independent of n).
12
![Page 13: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/13.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets
Consider finite A ⊆ [0,n− 1] chosen randomly with uniformdistribution from all subsets of [0,n − 1].Question: What is the structure of A + A for such A? whatthe distribution of |A + A| for such A?
Theorem: Martin, O’Bryant
E|A + A| = 2n − 1− 10 + O((3/4)n/2)
Theorem: ZhaoFor each fixed k , P(A ⊆ [0,n − 1] : |A + A| = 2n − 1− k) has alimit as n→∞
Note: Both theorem can be more naturally stated in terms ofmissing sums (independent of n).
13
![Page 14: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/14.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets
Consider finite A ⊆ [0,n− 1] chosen randomly with uniformdistribution from all subsets of [0,n − 1].Question: What is the structure of A + A for such A? whatthe distribution of |A + A| for such A?
Theorem: Martin, O’Bryant
E|A + A| = 2n − 1− 10 + O((3/4)n/2)
Theorem: ZhaoFor each fixed k , P(A ⊆ [0,n − 1] : |A + A| = 2n − 1− k) has alimit as n→∞
Note: Both theorem can be more naturally stated in terms ofmissing sums (independent of n).
14
![Page 15: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/15.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets, Continued
Why is the expectation so high? E |A + A| ∼ 2n − 11.
Main characteristic of typical A + A: middle is full.Many ways to write middle elements as sums
50 100 150 200
5
10
15
20
25
Figure: Comparison of predicted and observed number ofrepresentations of possible elements of the sumset, Miller
Key fact: if k < n, then P(k 6∈ A + A) ∼(3
4
)k/2
15
![Page 16: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/16.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets, Continued
Why is the expectation so high? E |A + A| ∼ 2n − 11.Main characteristic of typical A + A: middle is full.
Many ways to write middle elements as sums
50 100 150 200
5
10
15
20
25
Figure: Comparison of predicted and observed number ofrepresentations of possible elements of the sumset, Miller
Key fact: if k < n, then P(k 6∈ A + A) ∼(3
4
)k/2
16
![Page 17: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/17.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets, Continued
Why is the expectation so high? E |A + A| ∼ 2n − 11.Main characteristic of typical A + A: middle is full.Many ways to write middle elements as sums
50 100 150 200
5
10
15
20
25
Figure: Comparison of predicted and observed number ofrepresentations of possible elements of the sumset, Miller
Key fact: if k < n, then P(k 6∈ A + A) ∼(3
4
)k/2
17
![Page 18: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/18.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Structure of Random Sets, Continued
Why is the expectation so high? E |A + A| ∼ 2n − 11.Main characteristic of typical A + A: middle is full.Many ways to write middle elements as sums
50 100 150 200
5
10
15
20
25
Figure: Comparison of predicted and observed number ofrepresentations of possible elements of the sumset, Miller
Key fact: if k < n, then P(k 6∈ A + A) ∼(3
4
)k/2
18
![Page 19: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/19.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
New Results
Theorem: Bounds on the distribution (Lazarev, 2011)
0.70k � P(A + A has k missing sums)� 0.80k
From numerical data, conjecture that
P(A + A has k missing sums) ∼ 0.78k
and Log(P(A + A has k missing sums)) is eventually linear:
Figure: Log P(k missing sums) for 5 · 108 trial A of size 120
19
![Page 20: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/20.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
New Results
Theorem: Bounds on the distribution (Lazarev, 2011)
0.70k � P(A + A has k missing sums)� 0.80k
From numerical data, conjecture that
P(A + A has k missing sums) ∼ 0.78k
and Log(P(A + A has k missing sums)) is eventually linear:
Figure: Log P(k missing sums) for 5 · 108 trial A of size 120
20
![Page 21: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/21.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
New Results
Theorem: Bounds on the distribution (Lazarev, 2011)
0.70k � P(A + A has k missing sums)� 0.80k
From numerical data, conjecture that
P(A + A has k missing sums) ∼ 0.78k
and Log(P(A + A has k missing sums)) is eventually linear:
Figure: Log P(k missing sums) for 5 · 108 trial A of size 120
21
![Page 22: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/22.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
New Results
Theorem: Bounds on the distribution (Lazarev, 2011)
0.70k � P(A + A has k missing sums)� 0.80k
From numerical data, conjecture that
P(A + A has k missing sums) ∼ 0.78k
and Log(P(A + A has k missing sums)) is eventually linear:
Figure: Log P(k missing sums) for 5 · 108 trial A of size 120
22
![Page 23: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/23.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
More Results
Theorem: Variance (Lazarev, 2011)Exact series for the variance (too long to fit on page...);also Var ∼ 35.98.
Theorem: Asymptotic formula for distribution ofconsecutive missing sums (Lazarev, 2011)
(12
)(k+i)/2
� P(A+A is missing [k , k+i])�(
12
)(k+i)/2
(1+εi)k
Key Obstacle: Dependent random variablesKey Approach: Graph theory! (and Fibonacci Numbers?)
23
![Page 24: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/24.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
More Results
Theorem: Variance (Lazarev, 2011)Exact series for the variance (too long to fit on page...);also Var ∼ 35.98.
Theorem: Asymptotic formula for distribution ofconsecutive missing sums (Lazarev, 2011)
(12
)(k+i)/2
� P(A+A is missing [k , k+i])�(
12
)(k+i)/2
(1+εi)k
Key Obstacle: Dependent random variablesKey Approach: Graph theory! (and Fibonacci Numbers?)
24
![Page 25: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/25.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
More Results
Theorem: Variance (Lazarev, 2011)Exact series for the variance (too long to fit on page...);also Var ∼ 35.98.
Theorem: Asymptotic formula for distribution ofconsecutive missing sums (Lazarev, 2011)
(12
)(k+i)/2
� P(A+A is missing [k , k+i])�(
12
)(k+i)/2
(1+εi)k
Key Obstacle: Dependent random variables
Key Approach: Graph theory! (and Fibonacci Numbers?)
25
![Page 26: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/26.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
More Results
Theorem: Variance (Lazarev, 2011)Exact series for the variance (too long to fit on page...);also Var ∼ 35.98.
Theorem: Asymptotic formula for distribution ofconsecutive missing sums (Lazarev, 2011)
(12
)(k+i)/2
� P(A+A is missing [k , k+i])�(
12
)(k+i)/2
(1+εi)k
Key Obstacle: Dependent random variablesKey Approach: Graph theory!
(and Fibonacci Numbers?)
26
![Page 27: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/27.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
More Results
Theorem: Variance (Lazarev, 2011)Exact series for the variance (too long to fit on page...);also Var ∼ 35.98.
Theorem: Asymptotic formula for distribution ofconsecutive missing sums (Lazarev, 2011)
(12
)(k+i)/2
� P(A+A is missing [k , k+i])�(
12
)(k+i)/2
(1+εi)k
Key Obstacle: Dependent random variablesKey Approach: Graph theory! (and Fibonacci Numbers?)
27
![Page 28: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/28.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bounds on the Distribution
28
![Page 29: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/29.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Upper Bound
Weaker Upper bound: P(A + A has k missing sums) < 0.93k
Proof sketch:
Recall P(k 6∈ A + A) =(3
4
)k/2
If k elements are missing, then missing one at least k/2from the edges
P(A + A has k missing sums) < P(k/2 6∈ A + A) <(34
)k/4 ∼ 0.93k
Note: Since the expectation is around 10 and expansion decay,all the higher moments are bounded as n→∞.
29
![Page 30: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/30.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Upper Bound
Weaker Upper bound: P(A + A has k missing sums) < 0.93k
Proof sketch:Recall P(k 6∈ A + A) =
(34
)k/2
If k elements are missing, then missing one at least k/2from the edges
P(A + A has k missing sums) < P(k/2 6∈ A + A) <(34
)k/4 ∼ 0.93k
Note: Since the expectation is around 10 and expansion decay,all the higher moments are bounded as n→∞.
30
![Page 31: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/31.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Upper Bound
Weaker Upper bound: P(A + A has k missing sums) < 0.93k
Proof sketch:Recall P(k 6∈ A + A) =
(34
)k/2
If k elements are missing, then missing one at least k/2from the edges
P(A + A has k missing sums) < P(k/2 6∈ A + A) <(34
)k/4 ∼ 0.93k
Note: Since the expectation is around 10 and expansion decay,all the higher moments are bounded as n→∞.
31
![Page 32: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/32.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Upper Bound
Weaker Upper bound: P(A + A has k missing sums) < 0.93k
Proof sketch:Recall P(k 6∈ A + A) =
(34
)k/2
If k elements are missing, then missing one at least k/2from the edges
P(A + A has k missing sums) < P(k/2 6∈ A + A) <(34
)k/4 ∼ 0.93k
Note: Since the expectation is around 10 and expansion decay,all the higher moments are bounded as n→∞.
32
![Page 33: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/33.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Upper Bound
Weaker Upper bound: P(A + A has k missing sums) < 0.93k
Proof sketch:Recall P(k 6∈ A + A) =
(34
)k/2
If k elements are missing, then missing one at least k/2from the edges
P(A + A has k missing sums) < P(k/2 6∈ A + A) <(34
)k/4 ∼ 0.93k
Note: Since the expectation is around 10 and expansion decay,all the higher moments are bounded as n→∞.
33
![Page 34: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/34.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Upper Bound
Weaker Upper bound: P(A + A has k missing sums) < 0.93k
Proof sketch:Recall P(k 6∈ A + A) =
(34
)k/2
If k elements are missing, then missing one at least k/2from the edges
P(A + A has k missing sums) < P(k/2 6∈ A + A) <(34
)k/4 ∼ 0.93k
Note: Since the expectation is around 10 and expansion decay,all the higher moments are bounded as n→∞.
34
![Page 35: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/35.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Lower Bound
Lower bound: P(A + A has k missing sums) > 0.01 · 0.70k
Proof sketch: Construction.
Let the first k/2 be missing from AFor the rest of elements, pick any set that fills inMartin/O’Bryant: P( fills in) > 0.01 independent of n
P(A + A has k missing sums) > 0.01(1
2
)k/2 ∼ 0.01 · 0.70k
35
![Page 36: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/36.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Lower Bound
Lower bound: P(A + A has k missing sums) > 0.01 · 0.70k
Proof sketch: Construction.Let the first k/2 be missing from A
For the rest of elements, pick any set that fills inMartin/O’Bryant: P( fills in) > 0.01 independent of n
P(A + A has k missing sums) > 0.01(1
2
)k/2 ∼ 0.01 · 0.70k
36
![Page 37: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/37.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Lower Bound
Lower bound: P(A + A has k missing sums) > 0.01 · 0.70k
Proof sketch: Construction.Let the first k/2 be missing from AFor the rest of elements, pick any set that fills in
Martin/O’Bryant: P( fills in) > 0.01 independent of n
P(A + A has k missing sums) > 0.01(1
2
)k/2 ∼ 0.01 · 0.70k
37
![Page 38: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/38.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Lower Bound
Lower bound: P(A + A has k missing sums) > 0.01 · 0.70k
Proof sketch: Construction.Let the first k/2 be missing from AFor the rest of elements, pick any set that fills inMartin/O’Bryant: P( fills in) > 0.01 independent of n
P(A + A has k missing sums) > 0.01(1
2
)k/2 ∼ 0.01 · 0.70k
38
![Page 39: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/39.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Lower Bound
Lower bound: P(A + A has k missing sums) > 0.01 · 0.70k
Proof sketch: Construction.Let the first k/2 be missing from AFor the rest of elements, pick any set that fills inMartin/O’Bryant: P( fills in) > 0.01 independent of n
P(A + A has k missing sums) > 0.01(1
2
)k/2 ∼ 0.01 · 0.70k
39
![Page 40: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/40.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Lower Bound
Lower bound: P(A + A has k missing sums) > 0.01 · 0.70k
Proof sketch: Construction.Let the first k/2 be missing from AFor the rest of elements, pick any set that fills inMartin/O’Bryant: P( fills in) > 0.01 independent of n
P(A + A has k missing sums) > 0.01(1
2
)k/2 ∼ 0.01 · 0.70k
40
![Page 41: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/41.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Bound on Distribution: Lower Bound
Lower bound: P(A + A has k missing sums) > 0.01 · 0.70k
Proof sketch: Construction.Let the first k/2 be missing from AFor the rest of elements, pick any set that fills inMartin/O’Bryant: P( fills in) > 0.01 independent of n
P(A + A has k missing sums) > 0.01(1
2
)k/2 ∼ 0.01 · 0.70k41
![Page 42: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/42.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Variance
42
![Page 43: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/43.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Variance
Can study Var|A + A| instead.Recall that
Var|A + A| = E(|A + A|2)− (E|A + A|)2
Therefore just need E(|A + A|2):
E(|A + A|2) =12n
∑A⊆[0,n−1]
|A + A|2
=12n
∑A⊆[0,n−1]
∑i,j∈A+A
1
=12n
∑0≤i,j≤2n−2
∑A:i,j∈A+A
1
=∑
0≤i,j≤2n−2
P(A : i and j ∈ A + A)
43
![Page 44: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/44.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Variance
Can study Var|A + A| instead.Recall that
Var|A + A| = E(|A + A|2)− (E|A + A|)2
Therefore just need E(|A + A|2):
E(|A + A|2) =12n
∑A⊆[0,n−1]
|A + A|2
=12n
∑A⊆[0,n−1]
∑i,j∈A+A
1
=12n
∑0≤i,j≤2n−2
∑A:i,j∈A+A
1
=∑
0≤i,j≤2n−2
P(A : i and j ∈ A + A)
44
![Page 45: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/45.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Problem: Dependent Random Variables
It is sufficient to study P(A : i and j 6∈ A + A):
P(A : i and j ∈ A + A) = 1− P(A : i 6∈ A + A)− P(A : j 6∈ A + A)+P(A : i and j 6∈ A + A).
Example: P(A : 3 and 7 6∈ A + A)Conditions:
i = 3 : 0 or 3 6∈ A j = 7 : 0 or 7 6∈ Aand 1 or 2 6∈ A and 1 or 6 6∈ A
and 2 or 5 6∈ Aand 3 or 4 6∈ A.
Since there are common integers in both lists, the events3 6∈ A + A and 7 6∈ A + A are dependent.
45
![Page 46: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/46.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Problem: Dependent Random Variables
It is sufficient to study P(A : i and j 6∈ A + A):
P(A : i and j ∈ A + A) = 1− P(A : i 6∈ A + A)− P(A : j 6∈ A + A)+P(A : i and j 6∈ A + A).
Example: P(A : 3 and 7 6∈ A + A)
Conditions:
i = 3 : 0 or 3 6∈ A j = 7 : 0 or 7 6∈ Aand 1 or 2 6∈ A and 1 or 6 6∈ A
and 2 or 5 6∈ Aand 3 or 4 6∈ A.
Since there are common integers in both lists, the events3 6∈ A + A and 7 6∈ A + A are dependent.
46
![Page 47: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/47.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Problem: Dependent Random Variables
It is sufficient to study P(A : i and j 6∈ A + A):
P(A : i and j ∈ A + A) = 1− P(A : i 6∈ A + A)− P(A : j 6∈ A + A)+P(A : i and j 6∈ A + A).
Example: P(A : 3 and 7 6∈ A + A)Conditions:
i = 3 : 0 or 3 6∈ A j = 7 : 0 or 7 6∈ Aand 1 or 2 6∈ A and 1 or 6 6∈ A
and 2 or 5 6∈ Aand 3 or 4 6∈ A.
Since there are common integers in both lists, the events3 6∈ A + A and 7 6∈ A + A are dependent.
47
![Page 48: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/48.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Problem: Dependent Random Variables
It is sufficient to study P(A : i and j 6∈ A + A):
P(A : i and j ∈ A + A) = 1− P(A : i 6∈ A + A)− P(A : j 6∈ A + A)+P(A : i and j 6∈ A + A).
Example: P(A : 3 and 7 6∈ A + A)Conditions:
i = 3 : 0 or 3 6∈ A j = 7 : 0 or 7 6∈ Aand 1 or 2 6∈ A and 1 or 6 6∈ A
and 2 or 5 6∈ Aand 3 or 4 6∈ A.
Since there are common integers in both lists, the events3 6∈ A + A and 7 6∈ A + A are dependent.
48
![Page 49: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/49.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Solution: Use Graphs!
Transform the conditions into a graph!
For each integers in [0,7], add a vertex with that integer.Then connect two vertices if add up to 3 or 7.
Example i = 3, j = 7:
01
2
34
5
6
7
7 0 3 4
6 1 2 5
One-to-one correspondence between conditions/edges(and integers/vertices).
49
![Page 50: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/50.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Solution: Use Graphs!
Transform the conditions into a graph!For each integers in [0,7], add a vertex with that integer.
Then connect two vertices if add up to 3 or 7.
Example i = 3, j = 7:
01
2
34
5
6
7
7 0 3 4
6 1 2 5
One-to-one correspondence between conditions/edges(and integers/vertices).
50
![Page 51: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/51.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Solution: Use Graphs!
Transform the conditions into a graph!For each integers in [0,7], add a vertex with that integer.Then connect two vertices if add up to 3 or 7.
Example i = 3, j = 7:
01
2
34
5
6
7
7 0 3 4
6 1 2 5
One-to-one correspondence between conditions/edges(and integers/vertices).
51
![Page 52: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/52.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Solution: Use Graphs!
Transform the conditions into a graph!For each integers in [0,7], add a vertex with that integer.Then connect two vertices if add up to 3 or 7.
Example i = 3, j = 7:
01
2
34
5
6
7
7 0 3 4
6 1 2 5
One-to-one correspondence between conditions/edges(and integers/vertices).
52
![Page 53: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/53.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Solution: Use Graphs!
Transform the conditions into a graph!For each integers in [0,7], add a vertex with that integer.Then connect two vertices if add up to 3 or 7.
Example i = 3, j = 7:
01
2
34
5
6
7
7 0 3 4
6 1 2 5
One-to-one correspondence between conditions/edges(and integers/vertices).
53
![Page 54: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/54.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Solution: Use Graphs!
Transform the conditions into a graph!For each integers in [0,7], add a vertex with that integer.Then connect two vertices if add up to 3 or 7.
Example i = 3, j = 7:
01
2
34
5
6
7
7 0 3 4
6 1 2 5
One-to-one correspondence between conditions/edges(and integers/vertices).
54
![Page 55: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/55.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Solution: Use Graphs!
Transform the conditions into a graph!For each integers in [0,7], add a vertex with that integer.Then connect two vertices if add up to 3 or 7.
Example i = 3, j = 7:
01
2
34
5
6
7
7 0 3 4
6 1 2 5
One-to-one correspondence between conditions/edges(and integers/vertices).
55
![Page 56: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/56.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Interpretation of Graphs
Transformed into:
7 0 3 4 6 1 2 5
Need to pick integers so that each condition is satisfied.Therefore, need to pick vertices so that each edge has avertex chosen.So need to pick a vertex cover!Each integer is equally likely so can ignore vertex labels!
56
![Page 57: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/57.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Interpretation of Graphs
Transformed into:
7 0 3 4 6 1 2 5
Need to pick integers so that each condition is satisfied.
Therefore, need to pick vertices so that each edge has avertex chosen.So need to pick a vertex cover!Each integer is equally likely so can ignore vertex labels!
57
![Page 58: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/58.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Interpretation of Graphs
Transformed into:
7 0 3 4 6 1 2 5
Need to pick integers so that each condition is satisfied.Therefore, need to pick vertices so that each edge has avertex chosen.
So need to pick a vertex cover!Each integer is equally likely so can ignore vertex labels!
58
![Page 59: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/59.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Interpretation of Graphs
Transformed into:
7 0 3 4 6 1 2 5
Need to pick integers so that each condition is satisfied.Therefore, need to pick vertices so that each edge has avertex chosen.So need to pick a vertex cover!
Each integer is equally likely so can ignore vertex labels!
59
![Page 60: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/60.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Interpretation of Graphs
Transformed into:
7 0 3 4 6 1 2 5
Need to pick integers so that each condition is satisfied.Therefore, need to pick vertices so that each edge has avertex chosen.So need to pick a vertex cover!Each integer is equally likely so can ignore vertex labels!
60
![Page 61: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/61.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Vertex Covers
Have:
7 0 3 4 6 1 2 5
Example:7,0,4 and 6,2 form a vertex cover⇐⇒If 7,0,4,6,2 6∈ A, then 3,7 6∈ A + A
Lemma(Lazarev, 2011)
P(i , j 6∈ A + A) = P(pick a vertex cover for graph)
61
![Page 62: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/62.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Vertex Covers
Have:
7 0 3 4 6 1 2 5
Example:7,0,4 and 6,2 form a vertex cover
⇐⇒If 7,0,4,6,2 6∈ A, then 3,7 6∈ A + A
Lemma(Lazarev, 2011)
P(i , j 6∈ A + A) = P(pick a vertex cover for graph)
62
![Page 63: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/63.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Vertex Covers
Have:
7 0 3 4 6 1 2 5
Example:7,0,4 and 6,2 form a vertex cover⇐⇒If 7,0,4,6,2 6∈ A, then 3,7 6∈ A + A
Lemma(Lazarev, 2011)
P(i , j 6∈ A + A) = P(pick a vertex cover for graph)
63
![Page 64: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/64.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Vertex Covers
Have:
7 0 3 4 6 1 2 5
Example:7,0,4 and 6,2 form a vertex cover⇐⇒If 7,0,4,6,2 6∈ A, then 3,7 6∈ A + A
Lemma(Lazarev, 2011)
P(i , j 6∈ A + A) = P(pick a vertex cover for graph)
64
![Page 65: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/65.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Number of Vertex Covers
Condition graphs are always ‘segment’ graphs. So we just needg(n), the number of vertex covers for a ‘segment’ graph with nvertices.
Case 1: If the first vertex is chosen:x ? ? ? ?
Need an vertex cover for the rest of the graph: g(n − 1).Case 2: If the first vertex is not chosen:
o x ? ? ?
Need an vertex cover for the rest of the graph: g(n − 2).Fibonacci recursive relationship!
g(n) = g(n − 1) + g(n − 2)=⇒ g(n) = Fn+2
65
![Page 66: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/66.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Number of Vertex Covers
Condition graphs are always ‘segment’ graphs. So we just needg(n), the number of vertex covers for a ‘segment’ graph with nvertices.
Case 1: If the first vertex is chosen:
x ? ? ? ?
Need an vertex cover for the rest of the graph: g(n − 1).Case 2: If the first vertex is not chosen:
o x ? ? ?
Need an vertex cover for the rest of the graph: g(n − 2).Fibonacci recursive relationship!
g(n) = g(n − 1) + g(n − 2)=⇒ g(n) = Fn+2
66
![Page 67: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/67.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Number of Vertex Covers
Condition graphs are always ‘segment’ graphs. So we just needg(n), the number of vertex covers for a ‘segment’ graph with nvertices.
Case 1: If the first vertex is chosen:x ? ? ? ?
Need an vertex cover for the rest of the graph: g(n − 1).Case 2: If the first vertex is not chosen:
o x ? ? ?
Need an vertex cover for the rest of the graph: g(n − 2).Fibonacci recursive relationship!
g(n) = g(n − 1) + g(n − 2)=⇒ g(n) = Fn+2
67
![Page 68: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/68.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Number of Vertex Covers
Condition graphs are always ‘segment’ graphs. So we just needg(n), the number of vertex covers for a ‘segment’ graph with nvertices.
Case 1: If the first vertex is chosen:x ? ? ? ?
Need an vertex cover for the rest of the graph: g(n − 1).
Case 2: If the first vertex is not chosen:
o x ? ? ?
Need an vertex cover for the rest of the graph: g(n − 2).Fibonacci recursive relationship!
g(n) = g(n − 1) + g(n − 2)=⇒ g(n) = Fn+2
68
![Page 69: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/69.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Number of Vertex Covers
Condition graphs are always ‘segment’ graphs. So we just needg(n), the number of vertex covers for a ‘segment’ graph with nvertices.
Case 1: If the first vertex is chosen:x ? ? ? ?
Need an vertex cover for the rest of the graph: g(n − 1).Case 2: If the first vertex is not chosen:
o x ? ? ?
Need an vertex cover for the rest of the graph: g(n − 2).Fibonacci recursive relationship!
g(n) = g(n − 1) + g(n − 2)=⇒ g(n) = Fn+2
69
![Page 70: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/70.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Number of Vertex Covers
Condition graphs are always ‘segment’ graphs. So we just needg(n), the number of vertex covers for a ‘segment’ graph with nvertices.
Case 1: If the first vertex is chosen:x ? ? ? ?
Need an vertex cover for the rest of the graph: g(n − 1).Case 2: If the first vertex is not chosen:
o x ? ? ?
Need an vertex cover for the rest of the graph: g(n − 2).
Fibonacci recursive relationship!
g(n) = g(n − 1) + g(n − 2)=⇒ g(n) = Fn+2
70
![Page 71: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/71.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Number of Vertex Covers
Condition graphs are always ‘segment’ graphs. So we just needg(n), the number of vertex covers for a ‘segment’ graph with nvertices.
Case 1: If the first vertex is chosen:x ? ? ? ?
Need an vertex cover for the rest of the graph: g(n − 1).Case 2: If the first vertex is not chosen:
o x ? ? ?
Need an vertex cover for the rest of the graph: g(n − 2).Fibonacci recursive relationship!
g(n) = g(n − 1) + g(n − 2)
=⇒ g(n) = Fn+2
71
![Page 72: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/72.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Number of Vertex Covers
Condition graphs are always ‘segment’ graphs. So we just needg(n), the number of vertex covers for a ‘segment’ graph with nvertices.
Case 1: If the first vertex is chosen:x ? ? ? ?
Need an vertex cover for the rest of the graph: g(n − 1).Case 2: If the first vertex is not chosen:
o x ? ? ?
Need an vertex cover for the rest of the graph: g(n − 2).Fibonacci recursive relationship!
g(n) = g(n − 1) + g(n − 2)=⇒ g(n) = Fn+2
72
![Page 73: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/73.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
General i , j
In particular
P(3 and 7 6∈ A + A) =128 F4+2F4+2 =
14
since there were two graphs each of length 4.
In general, graphs will have many components withdifferent lengths.For odd i < j < n:
P(A : i and j 6∈ A + A)
=1
2j+1 F12
((j−i)
⌈i+1j−i
⌉−(i+1)
)2⌈
i+1j−i
⌉+2
× F12
(j+1−(j−i)
⌈i+1j−i
⌉)2⌈
i+1j−i
⌉+4
Need to find the formulas for when i , j are even....And to get variance, need to sum up over all i < j < 2n....
73
![Page 74: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/74.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
General i , j
In particular
P(3 and 7 6∈ A + A) =128 F4+2F4+2 =
14
since there were two graphs each of length 4.
In general, graphs will have many components withdifferent lengths.
For odd i < j < n:
P(A : i and j 6∈ A + A)
=1
2j+1 F12
((j−i)
⌈i+1j−i
⌉−(i+1)
)2⌈
i+1j−i
⌉+2
× F12
(j+1−(j−i)
⌈i+1j−i
⌉)2⌈
i+1j−i
⌉+4
Need to find the formulas for when i , j are even....And to get variance, need to sum up over all i < j < 2n....
74
![Page 75: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/75.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
General i , j
In particular
P(3 and 7 6∈ A + A) =128 F4+2F4+2 =
14
since there were two graphs each of length 4.
In general, graphs will have many components withdifferent lengths.For odd i < j < n:
P(A : i and j 6∈ A + A)
=1
2j+1 F12
((j−i)
⌈i+1j−i
⌉−(i+1)
)2⌈
i+1j−i
⌉+2
× F12
(j+1−(j−i)
⌈i+1j−i
⌉)2⌈
i+1j−i
⌉+4
Need to find the formulas for when i , j are even....And to get variance, need to sum up over all i < j < 2n....
75
![Page 76: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/76.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
General i , j
In particular
P(3 and 7 6∈ A + A) =128 F4+2F4+2 =
14
since there were two graphs each of length 4.
In general, graphs will have many components withdifferent lengths.For odd i < j < n:
P(A : i and j 6∈ A + A)
=1
2j+1 F12
((j−i)
⌈i+1j−i
⌉−(i+1)
)2⌈
i+1j−i
⌉+2
× F12
(j+1−(j−i)
⌈i+1j−i
⌉)2⌈
i+1j−i
⌉+4
Need to find the formulas for when i , j are even....
And to get variance, need to sum up over all i < j < 2n....
76
![Page 77: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/77.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
General i , j
In particular
P(3 and 7 6∈ A + A) =128 F4+2F4+2 =
14
since there were two graphs each of length 4.
In general, graphs will have many components withdifferent lengths.For odd i < j < n:
P(A : i and j 6∈ A + A)
=1
2j+1 F12
((j−i)
⌈i+1j−i
⌉−(i+1)
)2⌈
i+1j−i
⌉+2
× F12
(j+1−(j−i)
⌈i+1j−i
⌉)2⌈
i+1j−i
⌉+4
Need to find the formulas for when i , j are even....And to get variance, need to sum up over all i < j < 2n....
77
![Page 78: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/78.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Variance Formula
Var|A + A| = −40 + 4∑
i<j<n
P(i, j 6∈ A + A)
= −40 + O(cn)
+4∑
i,j odd
1
2j+1F
12
((j−i)
⌈i+1j−i
⌉−(i+1)
)2⌈
i+1j−i
⌉+2
F12
(j+1−(j−i)
⌈i+1j−i
⌉)2⌈
i+1j−i
⌉+4
+4∑
i even,j odd
1
2j+1F
2⌈
i/2+1j−i
⌉+1
F12
((j−i−1)
⌈i+1j−i
⌉−(i+1)+2
⌈i/2+1
j−i
⌉−1)
2⌈
i+1j−i
⌉+2
F12
(j+1−(j−i−1)
⌈i+1j−i
⌉−2⌈
i/2+1j−i
⌉)2⌈
i+1j−i
⌉+4
+4∑
i odd,j even
1
2j+1F
2⌈
j/2+1j−i
⌉F12
((j−i−1)
⌈i+1j−i
⌉−(i+1)+2
⌈j/2+1
j−i
⌉−2)
2⌈
i+1j−i
⌉+2
F12
(j+2−(j−i−1)
⌈i+1j−i
⌉+2⌈
j/2+1j−i
⌉)2⌈
i+1j−i
⌉+4
+4∑
i,j even
1
2j+1F
2⌈
i/2+1j−i
⌉+1
F2⌈ j+2
j−i
⌉ ×
F12
((j−i−2)
⌈i+1j−i
⌉−(i+1)+2
⌈i/2+1
j−i
⌉+2⌈
j/2+1j−i
⌉−3)
2⌈
i+1j−i
⌉+2
F12
(j+2−(j−i−2)
⌈i+1j−i +2
⌈i/2+1
j−i
⌉+2⌈
j/2+1j−i
⌉⌉)2⌈
i+1j−i
⌉+4
So clearlyVar |A + A| ∼ 35.98
78
![Page 79: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/79.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Variance Formula
Var|A + A| = −40 + 4∑
i<j<n
P(i, j 6∈ A + A)
= −40 + O(cn)
+4∑
i,j odd
1
2j+1F
12
((j−i)
⌈i+1j−i
⌉−(i+1)
)2⌈
i+1j−i
⌉+2
F12
(j+1−(j−i)
⌈i+1j−i
⌉)2⌈
i+1j−i
⌉+4
+4∑
i even,j odd
1
2j+1F
2⌈
i/2+1j−i
⌉+1
F12
((j−i−1)
⌈i+1j−i
⌉−(i+1)+2
⌈i/2+1
j−i
⌉−1)
2⌈
i+1j−i
⌉+2
F12
(j+1−(j−i−1)
⌈i+1j−i
⌉−2⌈
i/2+1j−i
⌉)2⌈
i+1j−i
⌉+4
+4∑
i odd,j even
1
2j+1F
2⌈
j/2+1j−i
⌉F12
((j−i−1)
⌈i+1j−i
⌉−(i+1)+2
⌈j/2+1
j−i
⌉−2)
2⌈
i+1j−i
⌉+2
F12
(j+2−(j−i−1)
⌈i+1j−i
⌉+2⌈
j/2+1j−i
⌉)2⌈
i+1j−i
⌉+4
+4∑
i,j even
1
2j+1F
2⌈
i/2+1j−i
⌉+1
F2⌈ j+2
j−i
⌉ ×
F12
((j−i−2)
⌈i+1j−i
⌉−(i+1)+2
⌈i/2+1
j−i
⌉+2⌈
j/2+1j−i
⌉−3)
2⌈
i+1j−i
⌉+2
F12
(j+2−(j−i−2)
⌈i+1j−i +2
⌈i/2+1
j−i
⌉+2⌈
j/2+1j−i
⌉⌉)2⌈
i+1j−i
⌉+4
So clearlyVar |A + A| ∼ 35.98
79
![Page 80: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/80.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums
80
![Page 81: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/81.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Improved Upper Bound
Use P(i , j 6∈ A + A) to improve the upper bound forP(A + A has k missing sums )
From previous section:
P(i , j 6∈ A + A) ∼(
φ2
2 · 51/4
)j (51/4
φ
)i
where φ is the golden ratioIf A + A is missing at k elements, then missing at least twoelements greater than k :
P(A+A has k missing sums ) <
(φ2
2 · 51/4
)k (51/4
φ
)k
∼ 0.80k
General idea: The better we know P(a1, · · · ,aj 6∈ A + A),the better we know the P(A + A has k missing sums )
81
![Page 82: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/82.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Improved Upper Bound
Use P(i , j 6∈ A + A) to improve the upper bound forP(A + A has k missing sums )
From previous section:
P(i , j 6∈ A + A) ∼(
φ2
2 · 51/4
)j (51/4
φ
)i
where φ is the golden ratio
If A + A is missing at k elements, then missing at least twoelements greater than k :
P(A+A has k missing sums ) <
(φ2
2 · 51/4
)k (51/4
φ
)k
∼ 0.80k
General idea: The better we know P(a1, · · · ,aj 6∈ A + A),the better we know the P(A + A has k missing sums )
82
![Page 83: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/83.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Improved Upper Bound
Use P(i , j 6∈ A + A) to improve the upper bound forP(A + A has k missing sums )
From previous section:
P(i , j 6∈ A + A) ∼(
φ2
2 · 51/4
)j (51/4
φ
)i
where φ is the golden ratioIf A + A is missing at k elements, then missing at least twoelements greater than k :
P(A+A has k missing sums ) <
(φ2
2 · 51/4
)k (51/4
φ
)k
∼ 0.80k
General idea: The better we know P(a1, · · · ,aj 6∈ A + A),the better we know the P(A + A has k missing sums )
83
![Page 84: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/84.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Improved Upper Bound
Use P(i , j 6∈ A + A) to improve the upper bound forP(A + A has k missing sums )
From previous section:
P(i , j 6∈ A + A) ∼(
φ2
2 · 51/4
)j (51/4
φ
)i
where φ is the golden ratioIf A + A is missing at k elements, then missing at least twoelements greater than k :
P(A+A has k missing sums ) <
(φ2
2 · 51/4
)k (51/4
φ
)k
∼ 0.80k
General idea: The better we know P(a1, · · · ,aj 6∈ A + A),the better we know the P(A + A has k missing sums )
84
![Page 85: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/85.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
Will study the particular case of P(a1, · · · ,aj 6∈ A + A) ofconsecutive missing sums: P(k , k + 1, · · · , k + i 6∈ A + A)
Example: P(16,17,18,19,20 6∈ A + A)
Start with original graph and remove some conditions (edges):
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
=⇒ Transforms to:
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
85
![Page 86: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/86.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
Will study the particular case of P(a1, · · · ,aj 6∈ A + A) ofconsecutive missing sums: P(k , k + 1, · · · , k + i 6∈ A + A)Example: P(16,17,18,19,20 6∈ A + A)
Start with original graph and remove some conditions (edges):
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
=⇒ Transforms to:
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
86
![Page 87: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/87.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
Will study the particular case of P(a1, · · · ,aj 6∈ A + A) ofconsecutive missing sums: P(k , k + 1, · · · , k + i 6∈ A + A)Example: P(16,17,18,19,20 6∈ A + A)
Start with original graph and remove some conditions (edges):
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
=⇒ Transforms to:
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
87
![Page 88: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/88.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
Will study the particular case of P(a1, · · · ,aj 6∈ A + A) ofconsecutive missing sums: P(k , k + 1, · · · , k + i 6∈ A + A)Example: P(16,17,18,19,20 6∈ A + A)
Start with original graph and remove some conditions (edges):
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
=⇒ Transforms to:
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
88
![Page 89: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/89.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
Will study the particular case of P(a1, · · · ,aj 6∈ A + A) ofconsecutive missing sums: P(k , k + 1, · · · , k + i 6∈ A + A)Example: P(16,17,18,19,20 6∈ A + A)
Start with original graph and remove some conditions (edges):
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
=⇒ Transforms to:
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
89
![Page 90: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/90.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
Will study the particular case of P(a1, · · · ,aj 6∈ A + A) ofconsecutive missing sums: P(k , k + 1, · · · , k + i 6∈ A + A)Example: P(16,17,18,19,20 6∈ A + A)
Start with original graph and remove some conditions (edges):
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
=⇒ Transforms to:
0 1 2 3 4 5 6 7 8
20 19 18 17 16 15 14 13 12 11 10 9
90
![Page 91: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/91.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
So get around 20/6 complete bipartite graphs like:
0 1 2
18 17 16
For a vertex cover, need one side to have all verticeschosen; occurs with probability ≤ 1
8 + 18 = 1
4
By independence, P(16,17,18,19,20) ≤(1
4
)20/6
In generalP(k , k + 1, k + 2, k + 3, k + 4) ≤
(14
)(k+4)/6 ∼ 0.79k+4
which is a slight improvement!
91
![Page 92: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/92.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
So get around 20/6 complete bipartite graphs like:
0 1 2
18 17 16
For a vertex cover, need one side to have all verticeschosen; occurs with probability ≤ 1
8 + 18 = 1
4
By independence, P(16,17,18,19,20) ≤(1
4
)20/6
In generalP(k , k + 1, k + 2, k + 3, k + 4) ≤
(14
)(k+4)/6 ∼ 0.79k+4
which is a slight improvement!
92
![Page 93: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/93.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
So get around 20/6 complete bipartite graphs like:
0 1 2
18 17 16
For a vertex cover, need one side to have all verticeschosen; occurs with probability ≤ 1
8 + 18 = 1
4
By independence, P(16,17,18,19,20) ≤(1
4
)20/6
In generalP(k , k + 1, k + 2, k + 3, k + 4) ≤
(14
)(k+4)/6 ∼ 0.79k+4
which is a slight improvement!
93
![Page 94: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/94.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums in A+A
So get around 20/6 complete bipartite graphs like:
0 1 2
18 17 16
For a vertex cover, need one side to have all verticeschosen; occurs with probability ≤ 1
8 + 18 = 1
4
By independence, P(16,17,18,19,20) ≤(1
4
)20/6
In generalP(k , k + 1, k + 2, k + 3, k + 4) ≤
(14
)(k+4)/6 ∼ 0.79k+4
which is a slight improvement!
94
![Page 95: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/95.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums
But most general is:P(k , k + 1, · · · , k + i 6∈ A + A) ≤
(12
)(k+i)/2(1 + εi)
k
However the trivial lower bound is:(12
)(k+i)/2 ≤ P(k , k + 1, · · · , k + i 6∈ A + A)Why interesting? Bounds almost match!Essentially the only way to miss a block of i consecutivesums is to miss all elements before the block as well.
95
![Page 96: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/96.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums
But most general is:P(k , k + 1, · · · , k + i 6∈ A + A) ≤
(12
)(k+i)/2(1 + εi)
k
However the trivial lower bound is:(12
)(k+i)/2 ≤ P(k , k + 1, · · · , k + i 6∈ A + A)
Why interesting? Bounds almost match!Essentially the only way to miss a block of i consecutivesums is to miss all elements before the block as well.
96
![Page 97: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/97.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums
But most general is:P(k , k + 1, · · · , k + i 6∈ A + A) ≤
(12
)(k+i)/2(1 + εi)
k
However the trivial lower bound is:(12
)(k+i)/2 ≤ P(k , k + 1, · · · , k + i 6∈ A + A)Why interesting? Bounds almost match!
Essentially the only way to miss a block of i consecutivesums is to miss all elements before the block as well.
97
![Page 98: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/98.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Consecutive Missing Sums
But most general is:P(k , k + 1, · · · , k + i 6∈ A + A) ≤
(12
)(k+i)/2(1 + εi)
k
However the trivial lower bound is:(12
)(k+i)/2 ≤ P(k , k + 1, · · · , k + i 6∈ A + A)Why interesting? Bounds almost match!Essentially the only way to miss a block of i consecutivesums is to miss all elements before the block as well.
98
![Page 99: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/99.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Summary
We found
Exponential bounds for distribution of number of missingsumsSeries for the variance in terms of Fibonacci numbersAsymptotic formula for consecutive missing sums
by developing graph theoretic framework for studyingdependent random variables.
99
![Page 100: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/100.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Summary
We foundExponential bounds for distribution of number of missingsums
Series for the variance in terms of Fibonacci numbersAsymptotic formula for consecutive missing sums
by developing graph theoretic framework for studyingdependent random variables.
100
![Page 101: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/101.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Summary
We foundExponential bounds for distribution of number of missingsumsSeries for the variance in terms of Fibonacci numbers
Asymptotic formula for consecutive missing sumsby developing graph theoretic framework for studyingdependent random variables.
101
![Page 102: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/102.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Summary
We foundExponential bounds for distribution of number of missingsumsSeries for the variance in terms of Fibonacci numbersAsymptotic formula for consecutive missing sums
by developing graph theoretic framework for studyingdependent random variables.
102
![Page 103: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/103.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Summary
We foundExponential bounds for distribution of number of missingsumsSeries for the variance in terms of Fibonacci numbersAsymptotic formula for consecutive missing sums
by developing graph theoretic framework for studyingdependent random variables.
103
![Page 104: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/104.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Future Research
And currently investigating/other research ideas:
Is distribution of missing sums approximately exponential?Is P(k + a1, · · · , k + am) ∼ λk for any fixed a1, · · · ,am?Higher moments: third moment involves P(i , j , k) whichhas more complicated graphsDistribution of missing differences inA− A = {x − y : x , y ∈ A}
104
![Page 105: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/105.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Future Research
And currently investigating/other research ideas:Is distribution of missing sums approximately exponential?
Is P(k + a1, · · · , k + am) ∼ λk for any fixed a1, · · · ,am?Higher moments: third moment involves P(i , j , k) whichhas more complicated graphsDistribution of missing differences inA− A = {x − y : x , y ∈ A}
105
![Page 106: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/106.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Future Research
And currently investigating/other research ideas:Is distribution of missing sums approximately exponential?Is P(k + a1, · · · , k + am) ∼ λk for any fixed a1, · · · ,am?
Higher moments: third moment involves P(i , j , k) whichhas more complicated graphsDistribution of missing differences inA− A = {x − y : x , y ∈ A}
106
![Page 107: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/107.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Future Research
And currently investigating/other research ideas:Is distribution of missing sums approximately exponential?Is P(k + a1, · · · , k + am) ∼ λk for any fixed a1, · · · ,am?Higher moments: third moment involves P(i , j , k) whichhas more complicated graphs
Distribution of missing differences inA− A = {x − y : x , y ∈ A}
107
![Page 108: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/108.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Future Research
And currently investigating/other research ideas:Is distribution of missing sums approximately exponential?Is P(k + a1, · · · , k + am) ∼ λk for any fixed a1, · · · ,am?Higher moments: third moment involves P(i , j , k) whichhas more complicated graphsDistribution of missing differences inA− A = {x − y : x , y ∈ A}
108
![Page 109: Distribution of Missing Sums in Sumsets...Distribution of Missing Sums in Sumsets Oleg Lazarev, Princeton University Advisor: Steven Miller, Williams College SMALL Research Program](https://reader033.vdocuments.us/reader033/viewer/2022041712/5e48a650829ebd271e3cee79/html5/thumbnails/109.jpg)
Introduction Bounds on Distribution Variance Consecutive Missing Sums Future Research
Thank you!
109