arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.2853math.NTmath.CO
收藏

具有规定表示函数的整数稠密集

Dense sets of integers with prescribed representation functions

Javier Cilleruelo, Melvyn B. Nathanson

摘要:

设A是一个整数集合,令h \geq 2。对于每一个整数n,令r_{A, h}(n)表示n的形式为n=a_1+.+ a_h,其中a_1,.,a_h属于集合A,并且a_1 \leq. \leq a_h.从整数Z到非负整数N_0 U的函数r_{A,h} { \infty }称为集合A的h阶表示函数。本文证明了从Z到N_0 U { \infty }的每个满足liminf_{|n|->\infty} f(n)\geq g的函数f是某个整数序列A的h阶表示函数,并且可以构造A使它的增长“几乎”与任何给定的B_h[g]序列一样慢.特别地,对于每个n>0和g \geq g(h,n),我们可以构造满足r_{A,h} =f和A(x)\gg x^{(1/h)-n}的序列A。

英文摘要:

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}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑