Answers are grounded in this paper and cite their sources.
Fix h≥ 2, and let b₁ , …, bₕ be not necessarily distinct positive integers with = 1. For any subset A⊆ N, write rA(n) (n≥ 0) for the number of solutions (k₁,…,kₕ)∈ Aʰ to \[ b_1 k_1 + ⋯ + b_h k_h = n. \] For which functions F with F(n) ≤ rN(n) can we find A⊆ N such that rA(n)~ F(n)? We show that if F is regularly varying, then there exists such an A provided limn→∞ F(n)/log n = ∞. If one only requires rA(n) F(n), we show there exists such an A for every increasing F satisfying F(2x) F(x) and n→∞ F(n)/log n > 0. Lastly, we give a probabilistic heuristic for the following statement: if A⊆ N is such that n→∞ rA(n)/log n < 1, then rA(n) = 0 for infinitely many n.
No takes yet. Share an insight, caveat, or question.
Christian Táfula (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: