ABSTRACT
For every domain R and every even integer n, we define ms n (R) (resp. ps n (R)) as the smallest number k such that zero is a sum of k + 1 products (resp. permuted products) of nth powers of nonzero elements from R. There are many results about ps n in the literature but nothing is known about ms n .
We prove two results about ms n of twisted Laurent series rings R((x,ω)). The first result is that if ms 2 (R) = ∞ and ω has order n/ 2 in Aut(R), then ms n (R((x,ω))) = ∞. The second result is that there exist R and ω such that ms n (R((x,ω))) = ∞ and ps n (R((x,ω))) < ∞. (Take , R = ℝ (t 1 ,…,t k ) and ω(f(t 1 ,…,t k )) = f( − t k ,t 1 − t k ,…,t k− 1 − t k ).)
Finally, we define ms n and ps n of a domain R with involution. For a certain involution on R((x,ω)), we prove analogues of the first and the second result.
Notes
Communicated by R. Parimala.