A ring $R$ with identity is called ``clean'' if $~$for every element $ain R$, there exist an idempotent $e$ and a unit $u$ in $R$ such that $a=u+e$. Let $C(R)$ denote the center of a ring $R$ and $g(x)$ be a polynomial in $C(R)[x]$. An element $rin R$ is called ``g(x)-clean'' if $r=u+s$ where $g(s)=0$ and $u$ is a unit of $R$ and, $R$ is $g(x)$-clean if every element is $g(x)$-clean. In this pa...

In many biomedical studies, the event of interest can occur more than once in a participant. These events are termed recurrent events. However, the majority of analyses focus only on time to the first event, ignoring the subsequent events. Several statistical models have been proposed for analysing multiple events. In this paper we explore and illustrate several modelling techniques for analysi...

‎there is a flatness property of acts over monoids called condition $(pwp)$ which‎, ‎so far‎, ‎has received‎ ‎much attention‎. ‎in this paper‎, ‎we introduce condition gp-$(p)$‎, ‎which is a generalization of condition $(pwp)$‎. ‎firstly‎, ‎some  characterizations of monoids by condition gp-$(p)$ of their‎ ‎(cyclic‎, ‎rees factor) acts are given‎, ‎and many known results are generalized‎. ‎more...

The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...

Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u  d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.

the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...

This paper is concerned with the following elliptic system:$$ left{ begin{array}{ll} -triangle u + b(x)nabla u + V(x)u=g(x, v), -triangle v - b(x)nabla v + V(x)v=f(x, u), end{array} right. $$ for $x in {R}^{N}$, where $V $, $b$ and $W$ are 1-periodic in $x$, and $f(x,t)$, $g(x,t)$ are super-quadratic. In this paper, we give a new technique to show the boundedness of Cerami sequences and estab...

‎There is a flatness property of acts over monoids called Condition $(PWP)$ which‎, ‎so far‎, ‎has received‎ ‎much attention‎. ‎In this paper‎, ‎we introduce Condition GP-$(P)$‎, ‎which is a generalization of Condition $(PWP)$‎. ‎Firstly‎, ‎some  characterizations of monoids by Condition GP-$(P)$ of their‎ ‎(cyclic‎, ‎Rees factor) acts are given‎, ‎and many known results are generalized‎. ‎More...