Let $(R, m)$ be a commutative noetherian local ring and let $Gamma$ be a finite group. It is proved that if $R$ admits a dualizing module, then the group ring $Rga$ has a dualizing bimodule as well. Moreover, it is shown that a finitely generated $Rga$-module $M$ has generalized Gorenstein dimension zero if and only if it has generalized Gorenstein dimension zero as an $R$-module.

“Nil”, “Nunca”, “Nada”, “Nothing”, “Zero”. Sounds of a multilingual class mathematics, perhaps. No, it is the sounds around family table card game as we all declare number tricks that would like to take in called Wizard. The speaker telling scorekeeper they not any tricks. They “zero” if could gather zero cards. We know do want and our best

Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$,  if no two vertices of $S$ are adjacent.The  independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.

In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...

In this paper we introduce the notions of G∗L-module and G∗L-module whichare two proper generalizations of δ-lifting modules. We give some characteriza tions and properties of these modules. We show that a G∗L-module decomposesinto a semisimple submodule M1 and a submodule M2 of M such that every non-zero submodule of M2 contains a non-zero δ-cosingular submodule.

‎Let Γa be a graph whose each vertex is colored either white or black‎. ‎If u is a black vertex of Γ such that exactly one neighbor‎ ‎v of u is white‎, ‎then u changes the color of v to black‎. ‎A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that‎ if initially the vertices in Z are colored black and the remaining vertices are colored white‎, ‎then Z changes the col...

In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...

aim : the aim of this study was to compare alternatives methods for analysis of zero inflated count data and compare them with simple count models that are used by researchers frequently for such zero inflated data. background : analysis of viral load and risk factors could predict likelihood of achieving sustain virological response (svr). this information is useful to protect a person from ac...