نتایج جستجو برای: commuting graphs
تعداد نتایج: 103441 فیلتر نتایج به سال:
At city level, personal monitoring is the best way to assess people's exposure. However, it is usually estimated from a few monitoring stations. Our aim was to determine the exposure to black carbon (BC) and BC dose for 45 schoolchildren with portable microaethalometers and to evaluate the relationship between personal monitoring and fixed stations at schools (indoor and outdoor) and in an urba...
In this paper we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and we call them graph Laplacian quantum states. Then we obtain structural properties of these graphs such that the corresponding graph Laplacian states have zero quantum discord by investigating structural properties o...
Building on recent work of Robertson and Steger, we associate a C∗–algebra to a combinatorial object which may be thought of as a higher rank graph. This C∗–algebra is shown to be isomorphic to that of the associated path groupoid. Various results in this paper give sufficient conditions on the higher rank graph for the associated C∗–algebra to be: simple, purely infinite and AF. Results concer...
In this paper we study the existence of commuting regular elements, verifying the notion left (right) commuting regular elements and its properties in the groupoid G(n). Also we show that G(n) contains commuting regular subsemigroup and give a necessary and sufficient condition for the groupoid G(n) to be commuting regular.
Tensor networks are a central tool in condensed matter physics. In this paper, we initiate the study of tensor network non-zero testing (TNZ): Given a tensor network T , does T represent a non-zero vector? We show that TNZ is not in the Polynomial-Time Hierarchy unless the hierarchy collapses. We next show (among other results) that the special cases of TNZ on nonnegative and injective tensor n...
in this paper we introduce the construction of free profinite products of profinite groups withcommuting subgroups. we study a particular case: the proper free profinite products of profinite groups with commuting subgroups. we prove some conditions for a free profinite product of profinite groups with commuting subgroups to be proper. we derive some consequences. we also compute profinite comp...
Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and x, y ∈ X (x 6= y) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ∆(G). The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(∆(G)) is abelian if and only if ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید