Báo cáo toán học: "The linear span of projections in simple C*-algebras " pot

... class="bi x0 y0 w2 h 1" alt =""

Ngày tải lên: 05/08/2014, 10:20

... ,g r ) be a sequence of linear forms in indeterminants x 1 , ,x n over K (i.e., linear combinations of the x i with coefficients in K). As defined in [4], such a sequence is a linear computation sequence ... the linear complexity of a graph to that of one of its subgraphs. In Section 3, we give several upper and lower bounds on the linear complexity of a graph. In...

Ngày tải lên: 07/08/2014, 13:21

... class="bi x0 y1 w2 h 2" alt =""

Ngày tải lên: 05/08/2014, 10:20

... I, et al.: Development of an ultrasound training curriculum in a limited resource international setting: successes and challenges of ultrasound training in rural Rwanda. Int J Emerg Med 2008, ... natural disasters in the past 2 decades, including the earthquake in Armenia in 1988 [35], Wenchuan, China, in 2008 [36], and Haiti in 2010 [37], and the tsunami in Indonesia...

Ngày tải lên: 20/06/2014, 21:20

...

Ngày tải lên: 05/08/2014, 09:46

... class="bi x0 y0 w1 h 1" alt =""

Ngày tải lên: 05/08/2014, 10:20

... (λ, ρ) of S in the direct product Λ(S) × P (S). The concept of translational hull of semigroups and rings was first introduced by Petrich in 1970 (see [11]). The translational hull of an inverse ... Shum 2 + 1 Dept. of Mathematics, Xi’an University of Archite cture and Technology Xi’an 710055, China 2 Faculty of Science, The Chinese University of Hong Kong, Hong Kong, China...

Ngày tải lên: 06/08/2014, 05:20

... > − −1, the elements X s K u,j and X s  F u,j are linearly independent. Proof. The proof of this lemma is same to the proof of Lemma 2.18 in [7]. For completeness, we write it out. Assume that ... representations in general. A complete list of simple modules of the quantum doubles of Taft algebras is given by Chen in [2]. He also gives all indecomposable modules for the...

Ngày tải lên: 06/08/2014, 05:20

... and indepen- dence number α(G). There has been great interest in finding good lower bounds for α(G)intermsofd, and producing polynomial–time algorithms which find large independent sets of G. In ... regular graphs in terms of a measure of the concentration of edges. Monien and Speckenmeyer in [6] investigated the special Ramsey number r k (q), the largest number of vertices i...

Ngày tải lên: 07/08/2014, 06:20

... now prove the following theorem. Theorem 1. Suppose G contains no 3 or 5 cycles. Let ¯ d be the average degree of vertices of G.Then α(G) ≥  n ¯ d/2. Proof. Since G contains no 3 or 5 cycles, ... 2 − ( k−1 k ) n k−1 k d 1 k . Proof. Immediate from Theorem 3. This improves Denley’s Theorem 4. References 1. Denley, T., The Independence number of graphs with large odd girth, The Electroni...

Ngày tải lên: 07/08/2014, 06:20