Order lifting for sparse additive bases of polynomial values
Statement
Problem 2.8 (T. Wooley). Suppose A is a subset of the naturals. We say that A is an additive basis of order h for a polynomial sequence {f (n): n = 1, 2,... } if hA contains this sequence. If f is linear, and A is any order h basis for f (n), then |A∩[n]| ≥ n1/h. If d =deg( f ) ≥
2, then one can trivially deduce that |A ∩ [n]| ≥ n1/hd. Can one get a substantially sharper lower bound in the case d ≥ 2?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.