نتایج جستجو برای: s set
تعداد نتایج: 1313407 فیلتر نتایج به سال:
Let $S$ be an inverse semigroup with the set of idempotents $E$. We prove that the semigroup algebra $ell^{1}(S)$ is always $2n$-weakly module amenable as an $ell^{1}(E)$-module, for any $nin mathbb{N}$, where $E$ acts on $S$ trivially from the left and by multiplication from the right. Our proof is based on a common fixed point property for semigroups.
let $g=(v,e)$ be a simple graph. a set $ssubseteq v$ isindependent set of $g$, if no two vertices of $s$ are adjacent.the independence number $alpha(g)$ is the size of a maximumindependent set in the graph. in this paper we study and characterize the independent sets ofthe zero-divisor graph $gamma(r)$ and ideal-based zero-divisor graph $gamma_i(r)$of a commutative ring $r$.
in chapter one we will describe definitions and preliminary results to provide the global context of our own results to be presented in detail in the subsequent chapters in chapter two we consider degree-one maps of the circle and we study their rotation set. our main result in this chapter says that if the map is topologically mixing then its rotation interval is nontrivial (that is, not reduc...
در تحقیق حاضر، با استفاده از ترکیب تئوری dsd و روش level set جبهه تراک تعقیب شده است. نخست، با استفاده از یک کد dsd یا از طریق مراجع، روابط d-? و d ?-d-? برای مواد شدیدالانفجار و مخلوط های گازی به دست آورده شده است، سپس با استفاده از روش level set، جبهه تراک در هندسه های مختلف تعقیب شده است. برای مواد شدیدالانفجار که در آن ها انحنا نقش مهمی را در دینامیک جبهه تراک دارد، همخوانی خوبی بین نتایج ت...
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
let $x$ be a real normed space, then $c(subseteq x)$ is functionally convex (briefly, $f$-convex), if $t(c)subseteq bbb r $ is convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$ is functionally closed (briefly, $f$-closed), if $t(k)subseteq bbb r $ is closed for all bounded linear transformations $tin b(x,r)$. we improve the krein-milman theorem ...
in this article, we have shown, for the add-point monad t, thepartial morphism category set*is isomorphic to the kleisli category sett. alsowe have proved that the category, sett, of t-algebras is isomorphic to thecategory set of pointed sets. finally we have established commutative squaresinvolving these categories.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید