2000 character limit reached
Rings additively generated by idempotents and nilpotents
Published 17 Mar 2018 in math.RA | (1803.06468v1)
Abstract: A ring R is a strongly 2-nil-clean if every element in R is the sum of two idempotents and a nilpotent that commute. A ring R is feebly clean if every element in R is the sum of two orthogonal idempotents and a unit. In this paper, strongly 2-nil-clean rings are studied with an emphasis on their relations with feebly clean rings. This work shows new interesting connections between strongly 2-nil-clean rings and weakly exchange rings
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.