Báo cáo toán học: " Strongly Almost Summable Difference Sequences" ppsx

... 76 (1984) 236–240. 21. S. Nanda, Strongly almost summable and strongly almost convergent sequences, Acta Math. Hung. 49 (1987) 71–76. 22. E. ¨ Ozt¨urk and T. Bilgin, Strongly summable sequence spaces ... 1970. Strongly Almost Summable Difference Sequences 339 19. E. Malkowsky and E. Savas, Some λ− sequence spaces defined by a modulus, Arch. Math. 36 (2000) 219–228. 20. S....

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

... partial difference sets are constructed, together with the corresponding strongly regular graphs. Our source are (96,20,4) regular symmetric designs. Keywords: Difference set, partial difference ... in strongly regular graphs. I.: A family of partial difference sets on 100 vertices, The Electronic Journal of Combina- torics, 1077-8926, vol. 101 ed. (2003), 17-31. [6] S.L. Ma, Partial...

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

... PDS D regular. Regular partial difference sets are equivalent to strongly regular Cayley graphs [11] and [18]. Latin square and negative Latin square type partial difference sets have connections ... partial difference sets from [13]. There are numerous other constructions of Latin square type partial difference sets that might be used to produce different negative Latin square type part...

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

... there exists a strongly w-minimal perfect matching, or a strongly w-minimal almost perfect matching. A strongly w-minimal perfect or almost perfect matching M is a perfect or almost perfect matching ... almost perfect matching that is strongly w-minimal (which is defined analogously to strongly w- maximal) among all perfect and almost perfect matchings in G (i.e. there is n...

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

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

... and (5) imply that a∪b = a∪c. Therefore, C B n is a strongly cancellative set. Now, we show that |C B n | ≤ 2 ⌊ n 2 ⌋ . Theorem 4.2. For any strongly cancellative C B n on B n , we have |C B n | ... size. In Section 4, we study strongly cancellative sets C B n on B n . We give a tight upper bound 2 ⌊ n 2 ⌋ on |C B n | for this lattice. Finally, Section 5 considers the strongly cancel...

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

... h 1" alt =""

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

... class="bi x0 y1 w2 h 2" alt =""

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

... h 1" alt =""

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

... class="bi x0 y0 w1 h 1" alt =""

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