نتایج جستجو برای: lambda admissible mapping
تعداد نتایج: 231151 فیلتر نتایج به سال:
در فصل اول این پایان نامه به بیان تعاریف و قضایای مقدماتی و در فصل دوم به مسئله ی وجود یک تراگرد روی خانواده ای از مجموعه ها می پردازیم. در ادامه این فصل به بررسی قضیه ی کلاسیک هال که شرط لازم و کافی را برای وجود چنین تراگرد ارائه می دهد می پردازیم. در ادامه فصل به بررسی روش ساختارهای مقدماتی روی یک خانواده می پردازیم و اندیس تراگرد را معرفی می کنیم. اگر $ mathfrak{a} $ خانواده ای ...
One of the most important prediction problems in finite population is the prediction of a linear function of characteristic values of a finite population. In this paper the admissibility of linear predictors of an arbitrary linear function of characteristic values in a finite population under reflected normal loss function is considered. Under the super-population model, we obtain the condition...
In this paper, at first, we introduce $alpha_{mu}$-admissible, $Z_mu$-contraction and $N_{mu}$-contraction via simulation functions. We prove some new fixed point theorems for defined class of contractions via $alpha$-admissible simulation mappings, as well. Our results can be viewed as extension of the corresponding results in this area. Moreover, some examples and an application to funct...
We study the spatiotemporal dynamics of random spatially distributed noninfinitesimal perturbations in one-dimensional chaotic extended systems. We find that an initial perturbation of finite size epsilon0 grows in time obeying the tangent space dynamic equations (Lyapunov vectors) up to a characteristic time tx(epsilon0) approximately b-(1/lambda(max))ln(epsilon0), where lambda(max) is the lar...
we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all $k$-subsets ofa $v$-set into $n$ disjoint $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$. we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and ...
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
If Visser’s rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate logics for which not all of Visser’s rules are admissible is not known. Here we study the situation for specific intermediate logics. We provide natural examples of logics for which Visser’s rule are derivable, admissible b...
in this paper, we introduce new classes $sum_{k,p,n}(alpha ,m,lambda ,l,rho )$ and $mathcal{t}_{k,p,n}(alpha ,m,lambda ,l,rho )$ of p-valent meromorphic functions defined by using the extended multiplier transformation operator. we use a strong convolution technique and derive inclusion results. a radius problem and some other interesting properties of these classes are discussed.
In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transit...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید