Additive Representation in Thin Sequences, IV: Lower Bound Methods (Q3148689)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1803933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Additive Representation in Thin Sequences, IV: Lower Bound Methods |
scientific article; zbMATH DE number 1803933 |
Statements
Additive Representation in Thin Sequences, IV: Lower Bound Methods (English)
0 references
6 February 2004
0 references
0.9170053
0 references
0.9168566
0 references
0.9060594
0 references
0.90403605
0 references
0.90403605
0 references
0.90287685
0 references
0.87482566
0 references
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}\).
0 references