Logarithmic Representability of Integers as k-Sums
Abstract
A set A=A_{k,n} in [n]\cup{0} is said to be an additive k-basis if each element in {0,1,...,kn} can be written as a k-sum of elements of A in at least one way. Seeking multiple representations as k-sums, and given any function phi(n), with lim(phi(n))=infinity, we say that A is a truncated phi(n)-representative k-basis for [n] if for each j in [alpha n, (k-alpha)n] the number of ways that j can be represented as a k-sum of elements of A_{k,n} is Theta(phi(n)). In this paper, we follow tradition and focus on the case phi(n)=log n, and show that a randomly selected set in an appropriate probability space is a truncated log-representative basis with probability that tends to one as n tends to infinity. This result is a finite version of a result proved by Erdos (1956) and extended by Erdos and Tetali (1990).
Cite
@article{arxiv.1302.1808,
title = {Logarithmic Representability of Integers as k-Sums},
author = {Anant P. Godbole and Samuel Gutekunst and Vince Lyzinski and Yan Zhuang},
journal= {arXiv preprint arXiv:1302.1808},
year = {2013}
}
Comments
18 pages