نتایج جستجو برای: noncommuting graph

تعداد نتایج: 198393  

2007
JOSEPH L. TAYLOR

The notions of nonsingularity, resolvent set, and spectrum, and the corresponding analytic functional calculus for n-tuples of elements of a commutative Banach algebra provide some of the deepest and most potent tools of modern analysis. A point of view one can adopt regarding this theory is as follows: The class of algebras (9(U)9 for U a domain in C9 provides a relatively small, well-understo...

Journal: :Physical review letters 2014
Haruki Watanabe Hitoshi Murayama

We show that momentum operators of a topological soliton may not commute among themselves when the soliton is associated with the second cohomology H2 of the target space. The commutation relation is proportional to the winding number, taking a constant value within each topological sector. The noncommutativity makes it impossible to specify the momentum of a topological soliton, and induces a ...

2007
Sean M. Carroll Miguel E. Ortiz

We present a self-contained analysis of theories of discrete 2D gravity coupled to matter, using geometric methods to derive equations for generating functions in terms of free (noncommuting) variables. For the class of discrete gravity theories which correspond to matrix models, our method is a generalization of the technique of SchwingerDyson equations and is closely related to recent work de...

We suggest an explicit viscosity iterative algorithm for finding a common element in the set of solutions of the general equilibrium problem system (GEPS) and the set of all common fixed points of two noncommuting nonexpansive self mappings in the real Hilbert space.  

Journal: :Journal of Functional Analysis 2014

2009
IGOR KLEP JANEZ POVH

An algorithm for finding sums of hermitian squares decompositions for polynomials in noncommuting variables is presented. The algorithm is based on the “Newton chip method”, a noncommutative analog of the classical Newton polytope method, and semidefinite programming.

2016
John Machacek

We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. To this coloring there is an associated symmetric function in noncommuting variables for which we give a deletion-contraction formula. In the case of graphs our symmetric function in noncommuting variables agrees with the chromatic symmetric function in noncommuting variab...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید