Báo cáo toán học: "Chromatic Roots of a Ring of Four Cliques" potx

... of graphs. A d-fold grid over G is a graph obtained from a d-dimensional rectangular grid of vertices by placing a graph from G on each of the lines parallel to one of the axes. Thus each vertex ... Ministry of Education of the Czech Republic as project 1M05 45. This research was also partially supported by the grant GACR 201/09/0197. † Research partially supported by the...

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

... of Mathematics & Statistics University of Western Australia, Australia gordon@maths.uwa.edu.au Dave Wagner Department of Combinatorics and Optimization University of Waterloo, Canada dgwagner@math.uwaterloo.ca Submitted: ... (2011), #P151 13 Chromatic Roots of a Ring of Four Cliques F.M. Dong ∗ Mathematics and Mathematics Education, National Institute of Education Na...

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

... U A =  H A H of an arrangement A. The result by Ziegler & ˇ Zivaljevi´c is actually far more general and is valid for general arrangements of linear subspaces. Here, we state an equivariant version ... combinatorics of an arrangement of hyperplanes in C n that generalizes the classical braid arrangement. The arrangement plays in important role in the work of Schechtman &...

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

... observation makes it apparent that similar replace- ments in the rest of Step 1 of Proposition 5 will produce a valid proof of Lemma 7. In particular, in (4.17), in the statements of Claim 1 and Claim ... to give a short inductive proof of the determinant evaluation in Theorem 10 (and also of its q-analogue in [9]), and could also be used to give an inductive proof of the de...

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

... that the set of permutations generated by a stack of depth two and an infinite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutations of length 5, 6, 7 and ... σ be a permutation. The following are equivalent. 1. σ can be generated by a stack of depth two and an infinite stack. 2. σ can be generated by Algorithm 4. 3. σ avoids the set...

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

... journal of combinatorics 17 (2010), #R19 14 Counting subwords in a partition of a set Toufik Mansour Department of Mathematics, University of Haifa, 31905 Haifa, Israel toufik@math.haifa.ac.il Mark ... − xA a 1 , which implies that A a = A a−1 + xA a 1  A a−1 −  a 2 m−1  x ℓ−2 (1 − y)  1 − xA a 1 = A a−1  1 −  a 2 m−1  x ℓ−1 (1 − y)  1 − xA a 1 . the electroni...

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

... became aware of a recent paper [10] by Daud´e and Ravelomanana. They studied a close but different case, when a system of m equations is chosen uniformly at random among all n(n − 1) equations of ... bichromatic with exponentially small probability. In [8] this exponential smallness was established for the conditional probability, given that the random graph has a giant component...

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

... (1991) 7. Matsuyama, T, Ikerata, R: On global solutions and energy decay for the wave equations of Kirchhoff type with nonlinear damping terms. J Math Anal Appl. 204, 729–753 (1996). doi:10.1006/jmaa.1996.0464 8. ... solutions of a wave equation with a boundary control of memory type. Nonlinear Anal Real World Appl. 11, 2896–2904 (2010). doi:10.1016/j.nonrwa.2009.10.013 18. Cavalcan...

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

...

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

...

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