Báo cáo toán học: "Almost uniformly continuous automorphism groups of operator algebras " ppt

Báo cáo toán học: " Central Limit Theorem for Functional of Jump Markov " pptx

Báo cáo toán học: " Central Limit Theorem for Functional of Jump Markov " pptx

... stationary distribution of Markov sequence {X n ,n≥ 0} by Π and if ν is the initial distribution of Markov sequence then P ν (.),E ν (.) are denoted for probability and expectation operator responding ... would like to thank Prof. Dr. Nguyen Huu Du and Prof. Dr. Tran Hung Thao for useful discussions. References 1. A. de Acosta, Moderate deviations for vector valued functional of a Mar...

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

19 348 0
Báo cáo toán học: "Minuscule Heaps Over Dynkin diagrams ˜ of type A" pptx

Báo cáo toán học: "Minuscule Heaps Over Dynkin diagrams ˜ of type A" pptx

... structure of a minuscule heap. By the symmetry of the shape of the Dynkin diagram of type ˜ A, to determine the structure of all of 1-intervals is equivalent to determine that of all of v-intervals ... labels of the elements are of type (T1). By a similar argument, we obtain the case (T2) from the assumption φ(p 1 )=φ(p 0 ) − 1. We say that P is of type (T1) (resp. (T2))...

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

20 209 0
Báo cáo toán học: "Maximum matchings in regular graphs of high girth" ppt

Báo cáo toán học: "Maximum matchings in regular graphs of high girth" ppt

... monotonicity of f(δ) in the required range, and completes the proof of the theorem. ✷ References [1] A. Alon, S. Hoory, N. Linial, A Continuous Analogue of the Girth Problem, Journal of Combinatorial ... fraction of the vertices, O((d − 1) −g/2 ). Specifically, in a maximum matching of G, the number of unmatched vertices is at most n/n 0 (d, g), where n 0 (d, g) is the number...

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

4 329 0
Báo cáo toán học: "The Skew and Relative Derangements of Type B" pptx

Báo cáo toán học: "The Skew and Relative Derangements of Type B" pptx

... introducing the notion of relative derangements of type B, also called signed relative derangements, which are defined in terms of signed permutations, we obtain a type B analogue of the well-known ... construction based on variant of Foata’s first fundamental transformation. The main objective of this paper is to present a type B analogue of the electronic journal of combinator...

Ngày tải lên: 07/08/2014, 15:22

8 384 0
Báo cáo toán học: " Robinson-Schensted correspondence for the signed Brauer algebras" pptx

Báo cáo toán học: " Robinson-Schensted correspondence for the signed Brauer algebras" pptx

... (4.1) The proof is same as in the case of symmetric group, we give for the sake of completion. We prove this claim by induction on the number of rows in P . For P = δ r , both sides of equation ... along columns. Similar argument like that of Knuth relation of first kind works for the Knuth relation of third kind. This completes one half of the proof. We will show that π 1 ∼ π...

Ngày tải lên: 07/08/2014, 15:22

26 302 0
Báo cáo toán học: "hape-Wilf-Ordering on Permutations of Length 3" pptx

Báo cáo toán học: "hape-Wilf-Ordering on Permutations of Length 3" pptx

... subdiagrams of Y of smaller sizes. Since by construction the diagonals d(U) and d(V ) lie on d(Y ), the set of critical points of U and V is the same as the set of critical points of Y , short of P ... columns of Y which are to the right of P , and therefore each of these k −i columns contains exactly 1 element of T . Hence k −i of P Y ’s rows contain an element of T...

Ngày tải lên: 07/08/2014, 15:22

44 156 0
Báo cáo toán học: "k-cycle free one-factorizations of complete graphs" pptx

Báo cáo toán học: "k-cycle free one-factorizations of complete graphs" pptx

... free one-factorization of K n+1 , then a k-cycle free one-factorization of K pn+1 exists. Proof: Assume that a k-cycle free one-factorization ˜ F of K n is given. Let H be the union of two one-factors ... constructions of 2n-cycle free one-factorizations of K 2n . However, the existence of n-cycle free one- factorization of K n when n ≡ 2 (mod 4), by Lemma 10, immediately impl...

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

14 174 0
Báo cáo toán học: "Coverings, Laplacians, and Heat Kernels of Directed Graphs" ppt

Báo cáo toán học: "Coverings, Laplacians, and Heat Kernels of Directed Graphs" ppt

... journal of combinatorics 16 (2009), #R31 8 Lemma 3.2. If  G is a covering of G, then an eigenvalue of G is an eigenvalue of  G. Proof. If  G is a covering of G with respect to the map π of index ... length of an element γ ∈ Γ as (γ) = min{r : γ = v 1 . . .v r , v i ∈ X}. Let σ r be the number of elements of Γ of length r. Notice that σ r is the number of points on th...

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

25 207 0
Báo cáo toán học: " Strong convergence theorems and rate of convergence of multi-step iterative methods for continuous mappings on an arbitrary interval" pptx

Báo cáo toán học: " Strong convergence theorems and rate of convergence of multi-step iterative methods for continuous mappings on an arbitrary interval" pptx

... mathematical 21 comparison of the rate of convergence. The first one was introduced by Berinde [27]. He used this idea to compare the rate of convergence of Picard and Mann iterations for a class of Zamfirescu operators ... of convergence of Picard and Mann iterations for a class of quasi-contractive operators. It was shown in [29] that the Mann and Ishikawa iterations are equiv...

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

33 360 0
w