Problems in additive number theory
Item
-
Title
-
Problems in additive number theory
-
Identifier
-
d_2009_2013:1b2698da5090:10323
-
identifier
-
10244
-
Creator
-
Orosz, Brooke,
-
Contributor
-
Melvyn Nathanson
-
Date
-
2009
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Mathematics
-
Abstract
-
The first chapter deals with the following problem: Let f( n) be a growth function, and A be a sequence with f(n) ≤ an ≤ U f(n), U constant. Under what conditions is it possible to construct a sequence B, with bk ∼ betaf(k), which has A as a subsequence?;The next two chapters deal with the possible sizes of f( A) = {lcub} i=1n uiai | ai ∈ A{rcub} on different sets A, for certain forms f. The final chapter discusses counting relatively prime subsets of the natural numbers.
-
Type
-
dissertation
-
Source
-
2009_2013.csv
-
degree
-
Ph.D.
-
Program
-
Mathematics
