Abstract Suppose k ≥ 2 is an integer. Let Y be the poset with elements x 1 , y ,…, − such that < ⋯ and let $Y_{k}^{\prime }$ Y k ′ same but all relations reversed. We say a family of subsets [ n ] contains copy on consecu...

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...

TWO theorems nre proved on perfect codes. The first cne states tk.at Lloyd's theorem is true without tne assumption that the number of symbols in the alphabet is a prime power. The second thevrem asser?s the impossibility of perfect group codes over non-prime-pcwer-alphabets. IA V be a finite set, I VI = q > 2, and let 1 <_ e 2 ye be Ia:ional integers. We pu?iV= (1, 2,. .. . n). Forv=(Vi)~=l E ...

Let $R$ be a commutative ring with identity‎. ‎A proper ideal $P$ of $R$ is a $(n-1,n)$-$Phi_m$-prime ($(n-1,n)$-weakly prime) ideal if $a_1,ldots,a_nin R$‎, ‎$a_1cdots a_nin Pbackslash P^m$ ($a_1cdots a_nin Pbackslash {0}$) implies $a_1cdots a_{i-1}a_{i+1}cdots a_nin P$‎, ‎for some $iin{1,ldots,n}$; ($m,ngeq 2$)‎. ‎In this paper several results concerning $(n-1,n)$-$Phi_m$-prime and $(n-1,n)$-...

In this work, we use the $C^3P_{\,0}$ model to calculate decay widths of low lying charmonium $J^{PC}=1^{--}$ states, nominally $J/\psi(1S)$ and $\psi(2S)$, in following common channels: $\rho\,\pi$, $\omega\,\eta$, $\omega\,\eta^\prime$, $K^{\ast +}\,K^-$, 0}\,\bar{K}^0$, $\phi\,\eta$, $\phi\,\eta^\prime$.

in this paper, we introduce a new generalization of weakly prime ideals called $i$-prime. suppose $r$ is a commutative ring with identity and $i$ a fixed ideal of $r$. a proper ideal $p$ of $r$ is $i$-prime if for $a, b in r$ with $ab in p-ip$ implies either $a in p$ or $b in p$. we give some characterizations of $i$-prime ideals and study some of its properties.  moreover, we give conditions  ...

An algorithm to compute the set of prime implicates of a quantifierfree clausal formula X in first order logic had been presented in earlier work. As the knowledge base X is dynamic, new clauses are added to the old knowledge base. In this paper an incremental algorithm is presented to compute the prime implicates of X and a clause C from π(X) ∪ C. The correctness of the algorithm is also proved.