Báo cáo toán học: "Absolute values of completely hyponormal operators " docx

Báo cáo toán học: "Critical subgraphs of a random graph" docx

Báo cáo toán học: "Critical subgraphs of a random graph" docx

... sequence of L(F ), the low graph of the underlying multigraph of F . Each vertex- copy is paired to a copy of a vertex of degree k with probability kd k /2n = α. Therefore a.s. a vertex of degree ... more work. We will present this proof in the final section of the paper. The crux of the proof of Theorem 1.2 lies in showing that  k is a threshold for G k n,M in the sense o...

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

13 357 0
Báo cáo toán học: "Diagonal Sums of Boxed Plane Partitions" docx

Báo cáo toán học: "Diagonal Sums of Boxed Plane Partitions" docx

... simple proof of a nice formula for the means and covari- ances of the diagonal sums of a uniformly random boxed plane parition. An a × b × c boxed plane partition is an a × b grid of integers ... combinatorics 8 (2001), #N1 3 Diagonal Sums of Boxed Plane Partitions David B. Wilson Microsoft Research One Microsoft Way Redmond, WA 98052 dbwilson@microsoft.com Submitted: December 8, 20...

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

3 183 0
Báo cáo toán học: "A characterization of balanced episturmian sequences" docx

Báo cáo toán học: "A characterization of balanced episturmian sequences" docx

... is ultimately periodic. Proof. It is a direct consequence of Theorem 3.10. Corollary 3.13. None of the Arnoux-Rauzy sequences (A-strict episturmian sequences) are balanced. Proof. It follows from the ... equivalent. There are two different generalizations of Sturmian sequences for alphabets of cardinality k ≥ 3. A natural generalization of Sturmian sequences is the set of infinite e...

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

12 215 0
Báo cáo toán học: "Edge-bandwidth of the triangular grid" docx

Báo cáo toán học: "Edge-bandwidth of the triangular grid" docx

... = ∅}. the electronic journal of combinatorics 14 (2007), #R67 8 4 Proof of Theorem 1.1 We now turn to the proof of the lower bound in Theorem 1.1. Fix a choice of functions f, g : N → R ≥0 such ... still a connector of T , contradicting the minimality of S ∗ . Hence x is a neighbor of v 0 . By symmetric reasoning, y is also a neighbor of v 0 . We have argued that the endpoint...

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

11 224 0
Báo cáo toán học: " New Graphs of Finite Mutation Type" docx

Báo cáo toán học: " New Graphs of Finite Mutation Type" docx

... of finite mutation type because of Theorem 7. • Corollary 14 No graph of one of the 9 exceptional types contains X 6 or X 7 as a subgraph. 4 Conclusion We have exhibited two graphs which are of ... obtained from the other by a sequence of mutations and relabeling of the vertices. The mutation class of a graph Γ is the set of all isomorphism classes of graphs that are mutati...

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

15 384 0
w