
arXiv: 1007.2239
Suppose n >= 2. We show that there is no integer v >= 1 such that for all commutative rings R with identity, every element of the subring J(2^n,R) of R generated by 2^n-th powers can be written in the form \pm f_1^{2^n} \pm \cdots \pm f_v^{2^n} for some f_1,...,f_v \in R and some choice of signs.
Easier Waring problem, polynomial ring, Mathematics - Number Theory, 11T06, 13F20, Polynomial ring, FOS: Mathematics, Waring's problem and variants, Geometry and Topology, Number Theory (math.NT), easier Waring problem
Easier Waring problem, polynomial ring, Mathematics - Number Theory, 11T06, 13F20, Polynomial ring, FOS: Mathematics, Waring's problem and variants, Geometry and Topology, Number Theory (math.NT), easier Waring problem
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
