On a certain class of $\Lambda$-structures. I
نویسندگان
چکیده
منابع مشابه
A Certain Class of Character Module Homomorphisms on Normed Algebras
For two normed algebras $A$ and $B$ with the character space $bigtriangleup(B)neq emptyset$ and a left $B-$module $X,$ a certain class of bounded linear maps from $A$ into $X$ is introduced. We set $CMH_B(A, X)$ as the set of all non-zero $B-$character module homomorphisms from $A$ into $X$. In the case where $bigtriangleup(B)=lbrace varphirbrace$ then $CMH_B(A, X)bigcup lbrace 0rbrace$ is...
متن کاملA Brief Determination of Certain Class of Power Semicircle Distribution
In this paper, we give a new and direct proof for the recently proved conjecture raised in Soltani and Roozegar (2012). The conjecture can be proved in a few lines via the integral representation of the Gauss-hypergeometric function unlike the long proof in Roozegar and Soltani (2013).
متن کاملNovel MHC class I structures on exosomes.
Exosomes are nanometer-sized vesicles released by a number of cell types including those of the immune system, and often contain numerous immune recognition molecules including MHC molecules. We demonstrate in this study that exosomes can display a significant proportion of their MHC class I (MHC I) content in the form of disulfide-linked MHC I dimers. These MHC I dimers can be detected after r...
متن کاملA class of tight contact structures on Σ 2 × I
We employ cut and paste contact topological techniques to classify some tight contact structures on the closed, oriented genus-2 surface times the interval. A boundary condition is specified so that the Euler class of the of the contact structure vanishes when evaluated on each boundary component. We prove that there exists a unique, non-product tight contact structure in this case. AMS Classif...
متن کاملOn a certain class of nonideal clutters
In this paper we define the class of near-ideal clutters following a similar concept due to Shepherd [Near perfect matrices, Math. Programming 64 (1994) 295–323] for near-perfect graphs. We prove that near-ideal clutters give a polyhedral characterization for minimally nonideal clutters as near-perfect graphs did for minimally imperfect graphs. We characterize near-ideal blockers of graphs as b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1970
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1970.100940