pith. sign in

arxiv: 1007.2239 · v1 · submitted 2010-07-14 · 🧮 math.NT

Infinite Easier Waring Constants for Commutative Rings

classification 🧮 math.NT
keywords commutativeringssomecdotschoiceconstantseasierelement
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.