نتایج جستجو برای: trace class

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

Journal: :International Journal of Mathematics and Mathematical Sciences 2002

Journal: :Proceedings of the American Mathematical Society 1993

Journal: :Annales de l'Institut Fourier 2022

Consider three normal operators A,B,C on a separable Hilbert space ? as well scalar-valued spectral measures ? A ?(A), B ?(B) and C ?(C). For any ??L ? (? ×? ) X,Y?S 2 (?), the of Hilbert–Schmidt ?, we provide general definition triple operator integral ? (?)(X,Y) belonging to S (?) in such way that (?) belongs (S (?)×S (?),S (?)) bounded bilinear resulting mapping :L )?B is w * -continuous iso...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1975
E Seiler B Simon

WE PROVE THAT FOR ANY TRACE CLASS OPERATORS, [FORMULA: see text].

2011
Wojciech Czerwinski Slawomir Lasota

The paper is about a class of languages that extends context-free languages (CFL) and is stable under shuffle. Specifically, we investigate the class of partially-commutative context-free languages (pc CFL), where non-terminal symbols are commutative according to a binary independence relation, very much like in trace theory. The class has been recently proposed as a robust class subsuming CFL ...

2013
JIM CONANT

We study the cokernel of the Johnson homomorphism for the mapping class group of a surface with one boundary component. A graphical trace map simultaneously generalizing trace maps of Enomoto-Satoh and Conant-Kassabov-Vogtmann is given, and using technology from the author’s work with Kassabov and Vogtmann, this is is shown to detect a large family of representations which vastly generalizes se...

2014
Vasile Lauric

We define the class of almost semi-hyponormal operators on a Hilbert space and provide some sufficient conditions in which such operators are almost normal, that is their self-commutator is in the trace-class. Mathematics Subject Classification: 47B20

2006
Barbara Klunder

Star-connected rational expressions were considered only as expressions defining trace languages. In this paper we continue the study of the class of flat languages defined by this kind of rational expressions (see [5], [4]). We obtain stronger results and prove that any language is star-connected iff it is accepted by a finite automaton with cycles which are proper composition of connected cyc...

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

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