Additive Number Theory 2010
DOI: 10.1007/978-0-387-68361-4_1
|View full text |Cite
|
Sign up to set email alerts
|

Addictive Number Theory

Abstract: In 1942 Mann solved a famous problem, the α + β conjecture, about the lower bound of the Shnirel'man density of sums of sets of positive integers. In 1945, Dyson generalized Mann's theorem and obtained a lower bound for the Shnirel'man density of rank r sumsets. His proof introduced a method that evolved into the Dyson transform, an important tool in additive number theory. This paper explains the background of Dyson's work, gives Dyson's proof of his theorem, and includes several applications of the Dyson tra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 44 publications
(7 reference statements)
0
2
0
Order By: Relevance
“…But for every k1 we have cqk1κfalse⟨qk1ηfalse⟩<qk1, that is, qk<c1qk1κ; hence we get trueright1jq/21jfalse⟨jηfalse⟩c1(logq)k=1qk1κ1c1false(logqfalse)2q1κ1,where we used the fact that q is bounded below by the th Fibonacci number. Next note that for any 1 and h1, by [28, Lemma 4.9], truerighthq+1j(h+1)q1j2+Tjjη1Thqr=1qmin()Thq,1false(hq+rfalse)η1(hq)2+logqTh…”
Section: Linear Form Diophantine Conditionsmentioning
confidence: 99%
See 1 more Smart Citation
“…But for every k1 we have cqk1κfalse⟨qk1ηfalse⟩<qk1, that is, qk<c1qk1κ; hence we get trueright1jq/21jfalse⟨jηfalse⟩c1(logq)k=1qk1κ1c1false(logqfalse)2q1κ1,where we used the fact that q is bounded below by the th Fibonacci number. Next note that for any 1 and h1, by [28, Lemma 4.9], truerighthq+1j(h+1)q1j2+Tjjη1Thqr=1qmin()Thq,1false(hq+rfalse)η1(hq)2+logqTh…”
Section: Linear Form Diophantine Conditionsmentioning
confidence: 99%
“…Let pk/qk be the kth convergent of the (simple) continued fraction expansion of η (see, for example, [14, Chapter X]; in particular 1=q0q1<q2<). For any 1 we have trueright1jq/21jfalse⟨jηfalse⟩=k=1qk1/2<jqk/21jfalse⟨jηfalse⟩k=1qk111jqk/21false⟨jηfalse⟩k=1qklogqkqk1,where the last bound follows from [28, Lemma 4.8], since false|ηpkqkfalse|<1qkqk+1 [14, Theorem 171]. But for every k1 we have cqk1κfalse⟨qk1ηfalse⟩<qk1, that is, qk<c1qk1κ; hence we get tru...…”
Section: Linear Form Diophantine Conditionsmentioning
confidence: 99%