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

... that a C-algebra has the standard character condition if it admits the stand ard character. Among other results we acquire a necessary and sufficient condition for a table algebra to originate from ... C, which is an integral table algebra (A, B) of dimension 3, then one can see that the standard character condition for (A, B) is equivalent to integrality condition for th...

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

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

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

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

... generalizations of this to certain submatrices of X n (called regular/singular character tables). We get such character tables for each choice of an integer  ≥ 2. This is a perhaps slightly surprising ... class regular (class singular). The regular character table X reg n contains the values of regular characters on regular classes and the singular character table X sing n is d...

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

... 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

... 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

... order n is k-traceable (for some k, 1 ≤ k ≤ n) if every induced sub(di)graph of G of order k is traceable. It follows from Dirac’s degree condition for hamiltonicity that for k ≥ 2 every k-traceable ... 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...

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

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

... consider an Ishikawa iteration method with errors for mapping with condition (B). We also consider the following iteration for mappings with condition (B). Let C be a nonempty closed convex subset ... of for a nonlinear mapping T with condition (C) by the Ishikawa itera- tion metho d on uniform convex Banach space with Opal property. Here, we also consider the Ishikawa iteration m...

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