Báo cáo toán học: "The Bounds on Components of the Solution for Consistent Linear Systems" pdf

Báo cáo toán học: "A Note on Divisibility of the Number of Matchings of a Family of Graphs" ppt

Báo cáo toán học: "A Note on Divisibility of the Number of Matchings of a Family of Graphs" ppt

... matching of G n , each block must contain at least one edge of the matching, because the center vertex in each block can be paired only with one of the other 3 vertices of the block. Furthermore, ... proves divisibility by powers of 2 for the number of matchings of the square grid graph. Theorem 1 For n odd, the number of perfect matchings of G n is a multi...

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

4 344 0
Báo cáo toán học: " Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive" pdf

Báo cáo toán học: " Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive" pdf

... and at the i th child of r attached T i (so the i th node on the second level is the root of T i ). There is a straight forward bijection between forests in F and subtrees of T ′ with s non-root ... it. To this end we formally define two types of constructive proofs. We only define these notions for proofs of lower bounds on W (k, c). It would be easy to define construc...

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

21 321 0
Báo cáo toán học: "The Bounds on Components of the Solution for Consistent Linear Systems" pdf

Báo cáo toán học: "The Bounds on Components of the Solution for Consistent Linear Systems" pdf

... 1–8. 4. W. Li, On the property of solutions of M-matrix equations, Systems Science and Math. S cience 10 (1997) 129–132. The Bounds on Comp onents of the Solution for Consistent Linear Systems ... a nonsingular M-matrix. Hence the result follows immediately from Theorem 3.1 of [3]. Vietnam Journal of Mathematics 33:1 (2005) 91–95 The Bounds on Components...

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

5 254 0
Báo cáo toán học: "Improved bounds on the length of maximal abelian square-free word" pot

Báo cáo toán học: "Improved bounds on the length of maximal abelian square-free word" pot

... left side of s m , whereas the m in the second subword must lie on the right side of s m , since it is in h m+1 . Thus for i ≥ m,therearetwoi’s to the right of the leftmost 6, at least one of which ... four, in order for it not to be the case that w contains exactly one occurrence of k − 1andthatk − 1 is one of the last six letters of w,thewordw must not cont...

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

12 317 0
Báo cáo toán học: " Metabolite proving fungal cleavage of the aromatic core part of a fluoroquinolone antibiotic" pdf

Báo cáo toán học: " Metabolite proving fungal cleavage of the aromatic core part of a fluoroquinolone antibiotic" pdf

... cleavage of the aromatic fluoroquinolone core for the first time. Hence, two decades after the emergence of the notion of the non- biodegradability of fluoroquinolones, fungal degradation of all ... group and the addition of one oxygen atom at position C-5, implicated the catechol-type congener F-5 (Figure 3). The identity of F-2 and F-5 was confirmed on t...

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

23 294 0
Báo cáo toán học: "A note on antichains of words" potx

Báo cáo toán học: "A note on antichains of words" potx

... that 7/4isthethreshold of repetition 1 Thanks to Kirby Baker for the use of his software which allowed the author to make these discoveries concerning abcacb. A note on antichains of words James ... length of word w is the number of letters in w, denoted by |w|. Thus |banana| = 6, for example. The language consisting of all words over Σ is denoted by Σ ∗ . If x, y ∈...

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

7 393 0
Báo cáo toán học: "Efficient covering designs of the complete graph" pptx

Báo cáo toán học: "Efficient covering designs of the complete graph" pptx

... Concludingremarksandanopenproblem WhenH=K h ,theconstantn 0 (H)inTheorem1.1isshownintheprooftobenolargerthan max{h 8 ,h 1 +h(h−1)},whereh 1 =h 1 (h)isthecorrespondingconstantinWilson’sTheorem. However,thebestknownboundforh 1 (and,consequently,forn 0 (H)),isratherlarge,andhighly exponentialinh[7].Itisplausible,however,thatthestatementofTheorem1.1isstillvalidfor n 0 (H)whichismuchsmaller.Infact...

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

8 284 0
Báo cáo toán học: "A Large Dihedral Symmetry of the Set of Alternating Sign Matrices" docx

Báo cáo toán học: "A Large Dihedral Symmetry of the Set of Alternating Sign Matrices" docx

... ofset from the entries of the ASM itself. If the entries of the ASM lie on vertices in the square grid, then the entries of the height function lie on the faces of that graph. We may choose the ... the proof of the theorem. Lemma. Two fixed vertices are in the same component of the blue (respectively green) subgraph after the action of H k if and o...

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

13 339 0
Báo cáo toán học: " A Purely Combinatorial Proof of the Hadwiger Debrunner (p, q) Conjectur" docx

Báo cáo toán học: " A Purely Combinatorial Proof of the Hadwiger Debrunner (p, q) Conjectur" docx

... that either one of the original convex sets has at least hM clones, or a proportion of at least i of the (d +1)-element collections among the M convex sets have points in common. Lemma 4. For every ... need only concern ourselves further with sets of g|Q| points which have at least 9g|Q|/10 of these on one side or the other of H. But there are only |Q|/2 points of Q...

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

8 380 0
w