Báo cáo toán học: "Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs" docx

... (2005) 5–38. [31] H. Tanaka , Classification of subsets with minimal width and dual width in Grass- mann, bilinear forms and dual polar graphs, J. Combin. Theory, Ser. A 113 (2006) 903–910. [32] ...  d) and T = T (x). Let W be an irreducible T -module with endpoint ǫ, dual endpoint ǫ ∗ and diameter δ (see (3.6)). By [7, Lemma 9.2, Theorem 9.4], W is thin, dual th...

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

... obtains all rhombus tilings in R 6 via translation of the two tilings in Figure 8. For the tiling ρ on the left, ν(ρ)= 4and ∈ R + 6 , because ν = 4 is minimal such that ρ +(0,ν)=ρ and ρ contains ... Translating the above rhombus tiling in all possible ways, we obtain 40 balanced (8, 10)-invariant rhombus tilings. We get another four tilings with the same property by tiling the pla...

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

... minimum turns out to be Φ min = p u k (λ)E k ∆ and, according to (18 ), the upper bound in (31) comes from ν 2 Φ min 1+Φ min . This bound corresponds to using in (26 ) the polynomial (37) with ... Dam and W.H. Haemers, A characterization of distance-regular graphs with diameter three, J. Algebraic Combin. 6 (1997) 299–303. [13] C. Delorme and P. Sol´e, Diameter, covering inde...

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

... T 1 and T 2 obtained in Step 2 of the bijection. The relabelings T  1 and T  2 obtained in Step 3 are shown in Figure 5. The vertex r in 7 0 4 5 1 2 8 3 6 T  2 T  1 Figure 5: Trees T  1 and ... 0 to n in T . Deleting this edge leaves two subtrees: T  1 with l vertices including 0, and T  2 with n +1−l vertices including r. 2. Relabel the vertices of T  1 as 0, ,l...

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

... Erd˝os and Zs. Tuza, Rainbow Hamiltonian paths and canonically colored sub- graphs in infinite complete graphs, Mathematica Pannonica 1(1990), 5-13. [8] P. Erd˝os and Zs. Tuza, Rainbow subgraphs in ... Broersma, X.L. Li, G. Woeginger and S.G. Zhang, Paths and cycles in colored graphs, Australasian J. Combin. 31(2005), 297-309. [5] H. Chen and X.L. Li, Color degree and color...

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

... containing e if and only if the two pegged edges e 1 and e 2 are both adja cent to e. Of course, in a view of the definition of pegging, they must be incident with different end-vert ices of e. Since ... uniformly at random. • Delete the edges in F . • Add a new vertex u, together with d edges joining u to each endvertex of the edges in F . The newly introduced vertex u is called...

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

... the integers within the three intervals ob- tained by multiplying each real number in S 3 (3, 1) by n (with slight modi- fication of the end-points due to integer round-off). To prove this integral version ... contradiction. Finding the value of u 2 =sup{x ∈ S | x< 2 k } is the key point in determining the structure of S; u 2 will turn out to be the right end-point of the second compone...

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

... below). For information about publishing your research in Fixed Point Theory and Applications go to http://www.fixedpointtheoryandapplications.com/authors/instructions/ For information about other SpringerOpen ... [3], Berinde–Berinde’s fixed point theorem [5] and references therein. Another interesting direction of research led to extend to the multivalued maps setting previous fixed poi...

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

... levels of interaction were implemented with Japanese handwriting tasks. While the first kind of interaction was mainly passive since it was using some pre-defined rules, the second type, an active interaction ... κ P and κ V are adaptive stiffness and damping gains in the plane of the circle. κ P ⊥ and κ V ⊥ are constant gains in a direction perpendicular to the circle. The variable...

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

... fixed point are obtained. By introducing a random iteration process with weak contraction random operator, we obtain a convergence theorem of the random iteration process to a random fixed point for ... nonexpansive random self-mappings. 1 Introduction Random nonlinear analysis is an important mathematical discipline which is mainly concerned with the study of random nonlinear operators an...

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