Additive Representation in Thin Sequences, IV: Lower Bound Methods

From MaRDI portal





The authors apply their method, introduced in Part~1 of the series [Ann. Sci. Éc. Norm. Supér. (4) 34, 471--501 (2001; Zbl 1020.11062)], to deal with numbers that are frequently represented in some prescribed manner. In particular they seek to demonstrate that integers from a polynomial sequence are frequently represented. Let \(\phi\) be an integer quadratic, and let \(N_\phi(X)\) count those \(n\leq X\) for which \(\phi(n)\) is the sum of five cubes of positive integers. Their first theorem states that \(N_\phi(X)\gg_\phi X^{129/136}\). Next, for an integral quadratic \(\phi\) of a certain shape, let \(X_\phi(N)\) count those \(n\leq N\) for which \(\phi(n)\) is a sum of a square and three cubes. Their second theorem states that \(X_\phi(N)\gg N^\theta\), where \(\theta<{20\over21}\).











This page was built for publication: Additive Representation in Thin Sequences, IV: Lower Bound Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148689)