2000 character limit reached
Rings whose Non-Invertible Elements are Strongly Nil-Clean (2404.10651v1)
Published 16 Apr 2024 in math.RA and math.RT
Abstract: We consider in-depth and characterize in certain aspects those rings whose non-units are strongly nil-clean in the sense that they are a sum of commuting nilpotent and idempotent. In addition, we examine those rings in which the non-units are uniquely nil-clean in the sense that they are a sum of a nilpotent and an unique idempotent. In fact, we succeeded to prove that these two classes of rings can completely be characterized in terms of already well-studied and fully described sorts of rings.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.