A normed space $mathfrak{X}$ is said to have the fixed point property, if for each nonexpansive mapping $T : E longrightarrow E $ on a nonempty bounded closed convex subset $ E $ of $ mathfrak{X} $ has a fixed point. In this paper, we first show that if $ X $ is a locally compact Hausdorff space then the following are equivalent: (i) $X$ is infinite set, (ii) $C_0(X)$ is infinite dimensional, (...

since wheat-rice cropping system is down in about 50000 hectare of khoozestan province and also necessity of optimum land and water utilization, this study was condulted during one year (2008-2009) in shawoor agricultural research station to compare different conservation tillage system with traditional system for wheat cultivation in paddy residue. experiment conducted in randomized complete b...

let $r$ be an infinite ring. here we prove that if $0_r$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin x}$ for every infinite subset $x$ of $r$, then $r$ satisfies the polynomial identity $x^n=0$. also we prove that if $0_r$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in x}$ for every infinite subset $x$ of $r$, then $x^n=x$ for all $xin r$.

In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms.

Nowadays the extent of productivity of Decision Making Units (DMUs) in future has a significant importance. One of the different types of calculating profitability of units is Malmq uist productivity index. All approaches presented so far calculate this index in present or past time using deterministic data. In this paper, a new approach based on DEA is presented for estimating Malmquist index ...

in this paper we consider the group algebra $r(c_2times‎ ‎d_infty)$‎. ‎it is shown that $r(c_2times d_infty)$ can be‎ ‎represented by a $4times 4$ block circulant matrix‎. ‎it is also‎ ‎shown that $mathcal{u}(mathbb{z}_2(c_2times d_infty))$ is‎ ‎infinitely generated‎.

‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...