Báo cáo toán học: "A q-analogue of some binomial coefficient identities of Y Sun" ppt

... the proof of (1.9). the electronic journal of combinatorics 18 (2011), #P78 4 A q-analogue of some binomial coefficient identities of Y. Sun Victor J. W. Guo 1 and Dan-Mei Yang 2 Department of Mathematics, ... 2011 Mathematics Subject Classifications: 05A10, 05A17 Abstract We give a q-analogue of some binomial coefficient identities of Y. Sun [Electron. J. Combi...

Ngày tải lên: 08/08/2014, 14:23

... coefficient of veratryl aldehyde (oxidized veratryl alcohol) at 310 nm is 9,300 M -1 cm -1 . One unit of enzyme activity represents the oxidation of veratryl alcohol to veratryl aldehyde at a rate of ... (f14tsakamoto@ec.usp.ac.jp) Yuki Yao (zv14yyao@ec.usp.ac.jp) Yoshifumi Hida (yhida@ses.usp.ac.jp) Yoichi Honda (yhonda@rish.kyoto-u.ac.jp) Takashi Watanabe (twatanab@rish.kyoto-u.ac...

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

... class="bi x0 y0 w2 h2" alt=""

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

... status of the problem can be obtained from Gordon Royle [2]. The General Construction We describe a family of cubic graphs with girths in the stated range. We begin with a description of a type of ... single values of h i by sets of values (we tried sets of size two). Neither of these modifications produced better constructions. References [1] N.L. Biggs, Algebraic Graph Theory...

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

... edge connecting two of its leaves. Assume G is an n-vertex graph having no P 5 and t p (n, P 5 )= e p (G). Trivially, G may only contain cycles of length 3 or 4. In fact, the vertices of every 4-cycle must ... Prague (1964), 29-36. ATur´an Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro ∗ and Raphael Yuster † Department of Mathematics University of Haifa-O...

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

... discussions of the polynomial time hierarchy and AM, we refer the reader to [9] and [4, 5]. The polynomial time hierarchy is the “polynomial time bounded variant” of the Kleene hierarchy of recursive ... vertex of K v .An easy argument shows that the isomorphisms of G  are in one-to-one correspon- dence with isomorphisms of G which fix χ. Specifically, if χ destroyed all of the s...

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

... Research from Ministry of Education, Science and Culture, Japan, and Japan Society for the Promotion of Science. ∗∗ Kyoto University. Email: tanigawa@kurims.kyoto-u.ac.jp. †† University of Calgary. Email: ... 52A10 Abstract Recently, Eisenbrand, Pach, Rothvoß, and Sopher studied the function M(m, n), which is the largest cardinality of a convexly independent subset of the Minkowski...

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

... in similar way to the nodes of degree seven, then, six, five and four. In each step, it is necessary to examine if S o of any node o is non-empty. It is possible that after a f ew steps of simplification, ... graph, it can only be one of the graphs from Figure 78, up to the change of orientations of all edges. Moreover, G has finitely many possible decompositions. the electronic jour...

Ngày tải lên: 08/08/2014, 14:23

... in any other case. The Cauchy problem y ′ = 2gty y 2 + gt 2 , y( 0) = λ I , can be solved by making the changes y = √ RS and t = √ S, so giving y 2 (t) − λ I y( t) − gt 2 = 0. Hence, y( 1) − g y( 1) = ... λ I , in any other case; where f is the right side of differential inequality (7). Now, the solution to Cauchy’s problem y ′ = δ u + δ v (y − t) 2 + δ u + δ v , y( 0) = λ I...

Ngày tải lên: 08/08/2014, 14:23

... assertion of the lemma. From the inequality inf y D F x 0 y (kt) ≥ inf x ,y D F x y (t) we get {t :inf y D F x 0 y (kt) ≤ 1 − λ}⊂{t :inf x ,y D F x y (t) ≤ 1 − λ}, hence 1 k {t :inf y D F x 0 y (t) ... λ}⊂{t :inf x ,y D F x y (t) ≤ 1 − λ}, so {t :inf y D F x 0 y (t) ≤ 1 − λ}⊂k{t :inf x ,y D F x y (t) ≤ 1 − λ}. This implies sup{t :inf y D F x 0 y (t) ≤ 1 − λ}≤k sup{t :inf...

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