In this paper, persents the definitions of strongly prime ideal, strongly prime N-subgroup, Pseudo-valuation near ring and Pseudo-valuation N-group. Some of their properties have also been proven by theorems. Then it is shown that, if N be near ring with quotient near-field K and P be a strongly prime ideal of near ring N, then is a strongly prime ideal of ‎‎, for any multiplication subset S of...

‎a ring $r$ is strongly clean provided that every element‎ ‎in $r$ is the sum of an idempotent and a unit that commutate‎. ‎let‎ ‎$t_n(r,sigma)$ be the skew triangular matrix ring over a local‎ ‎ring $r$ where $sigma$ is an endomorphism of $r$‎. ‎we show that‎ ‎$t_2(r,sigma)$ is strongly clean if and only if for any $ain‎ ‎1+j(r)‎, ‎bin j(r)$‎, ‎$l_a-r_{sigma(b)}‎: ‎rto r$ is surjective‎. ‎furt...

it is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. in this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.

let $r$ be a commutative ring with identity and let $m$ be an $r$-module. a proper submodule $p$ of $m$ is called strongly prime submodule if $(p + rx : m)ysubseteq p$ for $x, yin m$, implies that $xin p$ or $yin p$. in this paper, we study more properties of strongly prime submodules. it is shown that a finitely generated $r$-module $m$ is artinian if and only if $m$ is noetherian and every st...

in the present paper we define strongly δn -summable sequences which generalize a-summablesequences and prove such spaces to be complete paranormed spaces under certain conditions, sometopological results have also been discussed.

We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language of synchronizing words. Also we present a compact formula to calculate the syntactic complexity of this language.

An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Proc. London Math. Soc. 21 (1970) 716-730, obtained a characterization of strongly connected tournaments with exactly one Hamilton cycle (i.e., n-cycle). For n ≥, we characterize strongly connected n-partite tournaments ...

We model a two-candidate electoral competition in which there is uncertainty about a policy-relevant state of the world. The candidates receive private signals about the true state, which are imperfectly correlated. We study whether the candidates are able to credibly communicate their information to voters through their choice of policy platforms. Our results show that the fact that private in...

The inverse Gröbner basis problem is to find the ideals that have a given monomial ideal as its initial ideal. We consider the problem of finding when the given monomial ideal is the initial ideal of a prime ideal. Kalkbrenner and Sturmfels (1995), in Theorem 1, prove that the radical of the initial ideal of a prime ideal is equi-dimensional and connected in codimension one or equivalently, the...