Dense sets of integers with prescribed representation functions

Details Dense sets of integers with prescribed representation functions Dense sets of integers with prescribed representation functions

2007-08-21

arxiv.org/abs/0708.2853v1

Mathematics

Number Theory

10 pages

Scientific paper

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h} from the integers Z to the nonnegative integers N_0 U {\infty} is called the representation function of order h for the set A. We prove that every function f from Z to N_0 U {\infty} satisfying liminf_{|n|->\infty} f (n)\geq g is the representation function of order h for some sequence A of integers, and that A can be constructed so that it increases "almost" as slowly as any given B_h[g] sequence. In particular, for every epsilon >0 and g \geq g(h,epsilon), we can construct a sequence A satisfying r_{A,h}=f and A(x)\gg x^{(1/h)-epsilon}.

Affiliated with

Also associated with

No associations

Rating

Dense sets of integers with prescribed representation functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dense sets of integers with prescribed representation functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dense sets of integers with prescribed representation functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367314