نتایج جستجو برای: isomorphism of c
تعداد نتایج: 21261704 فیلتر نتایج به سال:
abstract the variables affecting the nature of reading comprehension can be classified into two general categories: reader’s variables, and text variables (alderson, 2000). despite the wave of research on vocabulary knowledge as reader’s variable, the role of this knowledge in c-test as a text-dependent test and its interaction with lexical cohesion of the test as a text feature has remained a...
double system of exponents with complex-valued coefficients is considered. under some conditions on the coefficients, we prove that if this system forms a basis for the morrey-lebesgue type space on $left[-pi , pi right]$, then it is isomorphic to the classical system of exponents in this space.
section{introduction} the concept of {sl cartan geometry} appeared at the beginning of the twentieth century, when {e}lie cartan was working on the so-called {sl equivalence problem}, the aim of which is to determine whether two given geometric structures can be mapped bijectively onto each other by some diffeomorphism. this problem can be considered in many different contexts, such as ...
this thesis basically deals with the well-known notion of the bear-invariant of groups, which is the generalization of the schur multiplier of groups. in chapter two, section 2.1, we present an explicit formula for the bear-invariant of a direct product of cyclic groups with respect to nc, c>1. also in section 2.2, we caculate the baer-invatiant of a nilpotent product of cyclic groups wuth resp...
Abstract We consider two inclusions of $C^{*}$ -algebras whose small have approximate units the large and their spaces all bounded bimodule linear maps. suppose that are strongly Morita equivalent. In this paper, we shall show there exists an isometric isomorphism from one maps to other space study basic properties about isomorphism. And, using isomorphism, define Picard group for a map discuss...
Let G be a finite group. A subset S of G not the identity element 1 of G called C I -subset (C( stands for isomorphism"), if for any isomorphism D(G, S) ~ D(G, T), there is f AutG such that T = f(S). G is called a DCI-group if every subset of G {I} is a CI-subset. G is called a GCl-group or simply a C I -group if every inverse-closed subset of G {I} is a CI-subset. (DCI and GCl stands for "digr...
Our starting point is the observation that if graphs in a class C have low descriptive complexity, then the isomorphism problem for C is solvable by a fast parallel algorithm. More precisely, we prove that if every graph in C is definable in a finite-variable first order logic with counting quantifiers within logarithmic quantifier depth, then Graph Isomorphism for C is in TC1 ⊆ NC2. If no coun...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید