نتایج جستجو برای: commuting probability
تعداد نتایج: 224847 فیلتر نتایج به سال:
In this paper, a common fixed point theorem for $psi$-weakly commuting maps in L-fuzzy metric spaces is proved.
3 We consider commuting squares of nite dimensional von Neumann algebras having the algebra of complex numbers in the lower left corner. Examples include the vertex models, the spin models (in the sense of subfactor theory) and the commuting squares associated to nite dimensional Kac algebras. To any such commuting square we associate a compact Kac algebra and we compute the corresponding subfa...
3 We consider commuting squares of nite dimensional von Neumann algebras having the algebra of complex numbers in the lower left corner. Examples include the vertex models, the spin models (in the sense of subfactor theory) and the commuting squares associated to nite dimensional Kac algebras. To any such commuting square we associate a compact Kac algebra and we compute the corresponding subfa...
BACKGROUND Vehicular traffic is a major source of outdoor air pollution in urban areas, and studies have shown that air pollution is worse during hours of commuting to and from work and school. However, it is unclear to what extent different commuting behaviors are a source of air pollution compared to non-commuters, and if air pollution exposure actually differs by the mode of commuting. This ...
In [HT2] Haagerup and Thorbjørnsen prove the following extension of Voiculescu’s random matrix model (cf. [V2, Theorem 2.2]): For each n ∈ N, let X 1 , . . . ,X (n) r be a system of r independent complex self-adjoint random matrices from the class SGRM(n, 1 n), and let x1, . . . , xr be a semicircular system in a C ∗-probability space. Then for any polynomial p in r non-commuting variables the ...
Let D be a division ring, n 2 a natural number, and C ⊆ Mn(D). Two matrices A and B are called C−commuting if there is C ∈ C that AB−BA = C. In this paper the C−commuting graph of Mn(D) is defined and denoted by ΓC(Mn(D)). Conditions are given that guarantee that the C−commuting graph is connected.
Let D be a division ring, n 2 a natural number, and C ⊆ Mn(D). Two matrices A and B are called C−commuting if there is C ∈ C that AB−BA = C. In this paper the C−commuting graph of Mn(D) is defined and denoted by ΓC(Mn(D)). Conditions are given that guarantee that the C−commuting graph is connected.
We investigate the relation between the structure of a Moufang loop and its inner mapping group. Moufang loops of odd order with commuting inner mappings have nilpotency class at most two. 6-divisible Moufang loops with commuting inner mappings have nilpotency class at most two. There is a Moufang loop of order 2 with commuting inner mappings and of nilpotency class three.
In this paper we study various simplicial complexes associated to the commutative structure of a finite group G. We define NC(G) (resp. C(G)) as the complex associated to the poset of pairwise non-commuting (resp. commuting) sets of nontrivial elements in G. We observe that NC(G) has only one positive dimensional connected component, which we call BNC(G), and we prove that BNC(G) is simply conn...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید