arXiv subjects
Publications and source records attributed to Dhiren Kumar Basnet.
In this article, we introduce a new graph theoretic structure associated with a finite commutative ring, called nil clean divisor graph. For a ring $R$, nil clean divisor graph is denoted by $G_N(R)$, where the vertex set is $\{x\in R\,:\, x\neq 0, \,\exists\, y(\neq 0, \neq x)\in R$ such that $xy$ is nil clean$\}$, two vertices $x$ and $y$ are adjacent if $xy$ is a nil clean element. We prove some interesting results of nil clean divisor graph of a ring.
Let $\mathbb{F}_{q^n}$ be the extension of the field $\mathbb{F}_q$ of degree n, where $q$ is power of prime $p$, i.e $q=p^k$, where k is a positive integer. In this paper, we provide sufficient condition for the existence of a primitive normal element $α\in\mathbb{F}_{q^n} $ such that $α^2+α+1$ is also primitive normal element over $\mathbb{F}_{q^n}$.
As a generalization of nil clean ideal, we define weak nil clean ideal of a ring. An ideal $I$ of a ring $R$ is weak nil clean ideal if for any $x\in I$, either $x=e+n$ or $x=-e+n$, where $n$ is a nilpotent element and $e$ is an idempotent element of $R$. Some interesting properties of weak nil clean ideal and its relation with weak nil clean ring have been discussed.
In this article, we introduce the concept of nilpotent graph of a finite commutative ring. The set of all non nilpotent elements of a ring is taken as the vertex set and two vertices are adjacent if and only if their sum is nilpotent. We discuss some graph theoretic properties of nilpotent graph.
Let $R$ be a finite ring. The commuting probability of $R$, denoted by $\Pr(R)$, is the probability that any two randomly chosen elements of $R$ commute. $R$ is called an $n$-centralizer ring if it has $n$ distinct centralizers. In this paper, we compute $\Pr(R)$ for some $n$-centralizer finite rings.
Motivated by the concept of clean ideals, we introduce the notion of nil clean ideals of a ring. We define an ideal $I$ of a ring $R$ to be nil clean ideal if every element of $I$ can be written as a sum of an idempotent and a nilpotent element of $R$. In this article we discuss various properties of nil clean ideals.
In this article, the concept of nil clean graph of a ring has been generalised to weakly nil clean graph of a ring and graph theoretic properties like girth, clique number, diameter and chromatic index of the graph have been studied for a finite commutative ring.
Let $S$ be a subring of a finite ring $R$ and $C_R(S) = \{r \in R : rs = sr \;\forall\; s \in S\}$. The relative non-commuting graph of the subring $S$ in $R$, denoted by $Γ_{S, R}$, is a simple undirected graph whose vertex set is $R \setminus C_R(S)$ and two distinct vertices $a, b$ are adjacent if and only if $a$ or $b \in S$ and $ab \neq ba$. In this paper, we discuss some properties of $Γ_{S, R}$, determine diameter, girth, some dominating sets and chromatic index for $Γ_{S, R}$. Also, we derive some connections between $Γ_{S, R}$ and the relative commuting probability of $S$ in $R$. Finally, we show that the relative non-commuting graphs of two relative $\Z$-isoclinic pairs of rings are isomorphic under some conditions.
Motivated by the concept of clean ideals, we introduce the notion of weakly clean ideals. We define an ideal $I$ of a ring $R$ to be weakly clean ideal if for any $x\in I$, $x=u+e$ or $x=u-e$, where $u$ is a unit in $R$ and $e$ is an idempotent in $R$. We discuss various properties of weakly clean ideals.
Motivated by the concept of weakly clean rings, we introduce the concept of weakly $r$-clean rings. We define an element $x$ of a ring $R$ as weakly $r$-clean if it can be expressed as $x=r+e$ or $x=r-e$ where $e$ is an idempotent and $r$ is a regular element of $R$. If all the elements of $R$ are weakly $r$-clean then $R$ is called a weakly $r$-clean ring. We discuss some of its properties in this article. Also we generalise this concept of weakly $r$-clean ring to weakly $g(x)$-$r$-clean ring, where $g(x) \in C(R)[x]$ and $C(R)$ is the centre of the ring $R$. Finally we introduce the concept of weakly $\star$-clean and $\star$-$r$-clean ring and discuss some of their properties.
For an element $a \in R$, let $η(a)=\{e\in R\mid e^2=e\mbox{ and }a-e\in \mbox{nil}(R)\}$. The nil clean index of $R$, denoted by NinA$(R)$, is defined as Nin$(R)=\sup \{\mid η(a)\mid: a\in R\}$. In this article we have characterized formal triangular matrix ring $\begin{pmatrix}A & M0 & B\end{pmatrix}$ with nil clean index $4$.
Let $R$ be a finite ring. The commuting probability of $R$ is the probability that any two randomly chosen elements of $R$ commute. In this paper, we obtain some bounds for commuting probability of $R$.
In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set, diameter etc. of nil clean graph have been studied for finite commutative rings.
Motivated by the concept of clean index of rings, we introduce the concept of weak clean index of rings. For any element $a$ of a ring $R$ with unity, we define $ χ(a)=\{e\in R\mid e^2=e\text{ and }a-e \mbox{ or } a+e \mbox{ is a unit}\}$. The weak clean index of $R$ is defined as $\sup \{|χ(a)|: a\in R\}$ and it is denoted by $\win(R),$ where $| χ(a)| $ denotes the cardinality of the set $χ(a)$. In this article, we characterize rings of weak clean indices $1$, $2$ and $3$.
Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $Γ_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two distinct vertices $a, b$ are adjacent if and only if $a \in S$ or $b \in S$ and $ab \neq ba$. We determine the diameter, girth and some dominating sets for $Γ_{S, K}$. Some connections between the $Γ_{S, K}$ and $\Pr(S, K)$ are also obtained. Further, $\Z$-isoclinism between two pairs of finite rings is defined and showed that the generalized non-commuting graphs of two $\Z$-isoclinic pairs are isomorphic under some condition.
In this paper, we compute the number of distinct centralizers of some classes of finite rings. We then characterize all finite rings with $n$ distinct centralizers for any positive integer $n \leq 5$. Further we give some connections between the number of distinct centralizers of a finite ring and its commutativity degree.
The commuting probability of a finite ring $R$, denoted by $\Pr(R)$, is the probability that any two randomly chosen elements of $R$ commute. In this paper, we obtain several bounds for $\Pr(R)$ through a generalization of $\Pr(R)$. Further, we define ${\Z}$-isoclinism between two pairs of rings and show that the generalized commuting probability, defined in this paper, is invariant under ${\Z}$-isoclinism between two pairs of finite rings.
We introduce the concept of a weak nil clean ring, a generalization of nil clean ring, which is nothing but a ring with unity in which every element can be expressed as sum or difference of a nilpotent and an idempotent. Further if the idempotent and nilpotent commute the ring is called weak* nil clean. We characterize all $n\in \mathbb{N}$, for which $\mathbb{Z}_n$ is weak nil clean but not nil clean. We show that if $R$ is a weak* nil clean and $e$ is an idempotent in $R$, then the corner ring $eRe$ is also weak* nil clean. Also we discuss $S$-weak nil clean rings and their properties, where $S$ is a set of idempotents and show that if $S=\{0, 1\}$, then a $S$-weak nil clean ring contains a unique maximal ideal. Finally we show that weak* nil clean rings are exchange rings and strongly nil clean rings provided $2\in R$ is nilpotent in the later case. We have ended the paper with introduction of weak J-clean rings.