A special atom (respectively, supernilpotent atom) is a minimal element of the lattice $\mathbb{S}$ of all special radicals (respectively, a minimal element of the lattice $\mathbb{K}$ of all supernilpotent radicals). A semiprime ring $R$ is called prime essential if every nonzero prime ideal of $R$ has a nonzero intersection with each nonzero two-sided ideal of $R$ . We construct a prime essential ring $R$ such that the smallest supernilpotent radical containing $R$ is not a supernilpotent atom but where the smallest special radical containing $R$ is a special atom. This answers a question put by Puczylowski and Roszkowska.
14 October 2014 in Bulletin of the Australian Mathematical Society
A semiprime ring $R$ is called a $\ast$ -ring if the factor ring $R/I$ is in the prime radical for every nonzero ideal $I$ of $R$ . A long-standing open question posed by Gardner asks whether the prime radical coincides with the upper radical $U(\ast _{k})$ generated by the essential cover of the class of all $\ast$ -rings. This question is related to many other open questions in radical theory which makes studying properties of $U(\ast _{k})$ worthwhile. We show that $U(\ast _{k})$ is an N-radical and that it coincides with the prime radical if and only if it is complemented in the lattice $\mathbb{L}_{N}$ of all N-radicals. Along the way, we show how to establish left hereditariness and left strongness of important upper radicals and give a complete description of all the complemented elements in $\mathbb{L}_{N}$ .
An even Eisenstein integer is a multiple of an Eisenstein prime of the least norm. Otherwise, an Eisenstein integer is called odd. An Eisenstein integer that is not an integer multiple of another one is said to be primitive. Such integers can be used to construct signal constellations and complex-valued codes over Eisenstein integers via a carefully designed modulo function. In this work, we establish algebraic properties of even, odd, and primitive Eisenstein integers. We investigate conditions for the set of all units in a given quotient ring of Eisenstein integers to form a cyclic group. We perform set partitioning based on the multiplicative group of the set. This generalizes the known partitioning of size a prime number congruent to 1 modulo 3 based on the multiplicative group of the Eisenstein field in the literature.
7 February 2017 in JP Journal of Algebra, Number Theory and Applications
The research in graph theory has been widened by combining it with ring. In this paper, we introduce the definition of a non-braid graph of a ring. The non-braid graph of a ring R, denoted by YR, is a simple graph with a vertex set R\B(R), where B(R) is the set of x in R such that xyx=yxy for all y in R. Two distinct vertices x and y are adjacent if and only if xyx not equal to yxy. The method that we use to observe the non-braid graphs of Zn is by seeing the adjacency of the vertices and its braider. The main objective of this paper is to prove the completeness and connectedness of the non-braid graph of ring Zn. We prove that if n is a prime number, the non-braid graph of Zn is a complete graph. For all n greater than equal to 3, the non-braid graph of Zn is a connected graph.
5 January 2024 in Journal of Algebra and Its Applications