نتایج جستجو برای: bound theorem
تعداد نتایج: 316723 فیلتر نتایج به سال:
a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$ implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some authors. recently, podoski and szegedy proved the truth of the converse of schur's theorem for capable groups. they also established an explicit bound for the index of the center of such...
ناحیه ظرفیت برای انتقال اطلاعات کلاسیک بر روی کانال های کوانتومی multiple acsses و همچنین انتقال اطلاعات کلاسیکی بصورت امن بر روی کانال های کوانتومی نقطه به نقطه، قبلاً محاسبه گردیده است. در این کار با استفاده از اثبات قضیه ظرفیت اطلاعات کلاسیک و نیز استفاده از قضیه اپراتورهای chernoff bound، ناحیه ظرفیت جدیدی جهت انتقال امن اطلاعات کلاسیک برروی کانال های کوانتومی multiple acsses با دو فرستنده و...
in the present paper, the deformation zone of the ecae (equal channel angular extrusion) process was investigated using the upper bound theorem. for this purpose, the shape of the streamlines in the deformation zone was assumed to be cubic bezier curves. then, the force required for the ecae process was optimized with regard to the parameters defining the shape of streamlines by the upper bound...
a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$ implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some authors. recently, podoski and szegedy proved the truth of the converse of schur's theorem for capable groups. they also established an explicit bound for the index of the...
chapter one is devotod to collect some notion and background informations, which are needed in the next chapters. it also contains some important statements which will be proved in a more general context later in this thesis. in chapter two, we show that if the marginal factor-group is of order np1...pk,n>1, then we obtain a bound for the order of the verbal subgroup. also a bound for the bear-...
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
Motivated by Candes and Donoho′s work (Candés, E J, Donoho, D L, Recovering edges in ill-posed inverse problems: optimality of curvelet frames. Ann. Stat. 30, 784-842 (2002)), this paper is devoted to giving a lower bound of minimax mean square errors for Riesz fractional integration transforms and Bessel transforms.
a 1993 result of j. llibre, and m. misiurewicz, (theorem a [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. also a 1980 result of l.s. block, j. guckenheimer, m. misiurewicz and l.s. young (lemma 1.5 [3]) states that if g is an a-graph of f then h(g) ? h( f ). in this pap...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید