Báo cáo toán học: "Shellability and the strong gcd-condition" doc

Báo cáo toán học: "Shellability and the strong gcd-condition" doc

Báo cáo toán học: "Shellability and the strong gcd-condition" doc

... 4.2.5]. There are several equivalent but differently flavored characterizations of Golod rings, see Sections 5.2 and 10.3 in [1] and the references therein. One is that R is Golod if the ranks of the ... order of the facets of ∆ ∨ . The complements F 1 c , . . . , F r c are the minimal non-faces of the flag complex ∆, so |F i c | = 2 and |F i | = |V |−2 for all i. Let j ≥ 2...
Ngày tải lên : 08/08/2014, 01:20
  • 7
  • 220
  • 0
Báo cáo toán học: "Triangulations and the Haj´s Conjecture " ppt

Báo cáo toán học: "Triangulations and the Haj´s Conjecture " ppt

... can go wrong. On the other hand, he observed that locally planar graphs and triangulations of the projective plane and the torus satisfy Haj´os Conjecture, and he conjectured that the same holds ... graph and not a digraph. Paley graphs have a number of intriguing properties. First of all, they are highly symmetric. Secondly, they are self-complementary. On the other hand, t...
Ngày tải lên : 07/08/2014, 08:22
  • 7
  • 415
  • 0
Báo cáo toán học: "Regularisation and the Mullineux map" pot

Báo cáo toán học: "Regularisation and the Mullineux map" pot

... v-decomposition numbers are the coefficients obtained when the elements of the canonical basis are expanded in terms of the standard basis, i.e. the coefficients d λµ (v) in the expression G(µ) =  λ d λµ (v)λ. We ... v-decomposition numbers; one con- cerning the Mullineux map, and the other concerning e-regularisation. The first of these involves the e-weight of a partition,...
Ngày tải lên : 07/08/2014, 21:21
  • 15
  • 173
  • 0
Báo cáo toán học: " Dilemmas in the reliable estimation of the in-vitro cell viability in magnetic nanoparticle engineering: which tests and what protocols?" doc

Báo cáo toán học: " Dilemmas in the reliable estimation of the in-vitro cell viability in magnetic nanoparticle engineering: which tests and what protocols?" doc

... increase in the coating diameter upon addition of the PEG moiety [33], thus increasing the stability of the nanoparticles and further shielding the cells from the iron oxide core. The cationic ... understanding of the degree of cytotoxicity of the MNPs, we also investigated the effect the polymer-coated nanoparticles had on the integrity of the cell membrane an...
Ngày tải lên : 20/06/2014, 20:20
  • 22
  • 476
  • 0
Báo cáo toán học: " Weak and strong convergence theorems of implicit iteration process on Banach spaces" pdf

Báo cáo toán học: " Weak and strong convergence theorems of implicit iteration process on Banach spaces" pdf

... Note that the conditions of strong convergence theorem are different from the strong convergence theorems for the implicit iterative processes in the literatures. Finally, we discuss a strong conver- gence ... strong convergence theorem are different from the strong convergence theorems for the implicit iterative processes in the literatures. Finally, we discuss a str...
Ngày tải lên : 20/06/2014, 21:20
  • 20
  • 383
  • 0
Báo cáo toán học: " Weak and strong convergence theorems of implicit iteration process on Banach spaces" doc

Báo cáo toán học: " Weak and strong convergence theorems of implicit iteration process on Banach spaces" doc

... nonexpansive mappings and a relative nonexpansive mapping on Banach spaces. Note that the conditions of strong convergence theorem are different from the strong convergence theorems for the implicit iterative ... strong convergence theorem are different from the strong convergence theorems for the implicit iterative processes in the literatures. Finally, we discuss a st...
Ngày tải lên : 20/06/2014, 21:20
  • 20
  • 388
  • 0
Báo cáo toán học: " Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type" pdf

Báo cáo toán học: " Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type" pdf

... symmetry in k and −k, amounts to the same as multiplying the sum by 2. This is made more transparent if we look at the decomposition of the summand f(k) into its even and its odd part, in the usual ... to α =0andn → 2n − 1, or, α = −1andn → 2n in the theorem of [2], cf. also (3.10) and (3.12) in Andrews [8].) As pointed out by Andrews [2], this finite version of (1) has its o...
Ngày tải lên : 07/08/2014, 06:20
  • 9
  • 343
  • 2
Báo cáo toán học: "Asymptotics for the Probability of Connectedness and the Distribution of Number of Components Jason P. Bell Department of Mathem" doc

Báo cáo toán học: "Asymptotics for the Probability of Connectedness and the Distribution of Number of Components Jason P. Bell Department of Mathem" doc

... provide easy examples for the application of Theorem 2. These and other graphical examples are discussed by Compton [10] and by Knopfmacher and Knopfmacher [18] in their interesting papers. Inevitably, ... =0. • In cases LC and UC, the next theorem proves the equivalence of the conditions under the additional assumption that lim c n−1 /c n exists. Theorem 2. Suppose that R&g...
Ngày tải lên : 07/08/2014, 06:20
  • 22
  • 344
  • 0