Báo cáo toán học: "Invariant operator ranges for reflexive algebras " doc

Báo cáo toán học: "Standard character condition for table algebras" doc

Báo cáo toán học: "Standard character condition for table algebras" doc

... the reader to [12] for the background of association schemes. 3 The standard feasible trace for C -algebras In this section we first define the standard feasible trace for C -algebras and then we ... combinatorics the concept of C-algebra is used for commutative algebras, in this paper we will also consider non-commutative algebras. Hence we deal with C -algebras in the sense of [7...

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

13 214 0
Báo cáo toán học: "A Scaling Result for Explosive Processes" docx

Báo cáo toán học: "A Scaling Result for Explosive Processes" docx

... with n balls obtains the next ball is proportional to f(n) for some function f. For example, a common case to study is when f(n)=n p for some constant p>1. Specifically, we consider the case ... remain open. For instance, are our methods applicable to related non-linear models for Web graphs [3]? It seems likely that this problem requires improvements on the error bounds for Gau...

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

14 360 0
Báo cáo toán học: "Bonferroni-Galambos Inequalities for Partition Lattices" doc

Báo cáo toán học: "Bonferroni-Galambos Inequalities for Partition Lattices" doc

... Connected k-uniform hypergraphs It is well-known (cf. [1, 10]) that for any n, k ∈ N the number c n,k of connected k-uniform hypergraphs on vertex-set {1, ,n} is given by the formula c n,k =  π∈ ... (U) g(σ)  |σ|−1 r  r! . Therefore, for any ω ∈ P(U), S ≥  σ∈ (U) σ≤ω g(σ)  |σ|−1 r  r! ≥  σ∈ (U) σ≤ω g(σ)  |ω|−1 r  r!=f(ω)  |ω|−1 r  r! . By choosing ω uniformly at random among al...

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

9 179 0
Báo cáo toán học: "A Traceability Conjecture for Oriented Graphs" docx

Báo cáo toán học: "A Traceability Conjecture for Oriented Graphs" docx

... been proved for all graphs with detour deficiency p ≤ 3. For p ≥ 4 it has been proved for all p-deficient graphs of order at least 10p 2 − 3p (see [5],[15]). We present here an easy proof for the case ... important special case of the Path Partition Conjecture for Oriented Graphs. In this paper we show the conjecture is true for k ≤ 5 and for certain classes of graphs. In addition...

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

13 278 0
Từ khóa:
w