Commutativity theorems for certain rings with polynomial constraints
This paper presents several theorems asserting commutativity of rings satisfying complicated and artificial commutator constraints. The following result is typical: Let \(p\), \(q\), \(r\) be nonnegative integers with \(r>1\), and let \(R\) be a ring with \(1\) such that \(r[x,y]=0\) implies \([x,y]=0\). If for each \(y\in R\) there exist \(f(t),g(t),h(t)\in\mathbb{Z}[t]\) such that \(g(y)[x,f(y)]h(y)=x^p[x^r,y]y^q\) for all \(x\in R\), then \(R\) is commutative. The proof given for the above theorem does not work for \(p=0\); some other proofs have problems as well.
- Commutativity of rings satisfying some polynomial conditions
- scientific article; zbMATH DE number 1033882 (Why is no real title available?)
- scientific article; zbMATH DE number 1777298 (Why is no real title available?)
- On commutativity of rings with some polynomial constraints
- Commutativity of rings with polynomial constraints
- scientific article; zbMATH DE number 777758 (Why is no real title available?)
- Commutativity theorems in groups with power-like maps
This page was built for publication: Commutativity theorems for certain rings with polynomial constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936398)
