Báo cáo toán học: " Strongly Almost Summable Difference Sequences" ppsx
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....
Báo cáo toán học: "New regular partial difference sets and strongly regular graphs with parameters (96,20,4,4) and (96,19,2,4)" ppsx
... 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...
Báo cáo toán học: "Generalizations of Partial Difference Sets from Cyclotomy to Nonelementary Abelian p-Groups" pdf
... 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...
Báo cáo toán học: "Strongly maximal matchings in infinite weighted graphs" pdf
... 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...
Báo cáo toán học: "Strongly Cancellative and Recovering Sets on Lattices" docx
... 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...
Báo cáo toán học: "Invariant operator ranges of nest algebras " ppsx
... class="bi x0 y1 w2 h 2" alt =""
Báo cáo toán học: "Ergodic actions of compact abelian groups " ppsx
... h 1" alt =""
Báo cáo toán học: "A simple unital projectionless C*-algebra " ppsx
... class="bi x0 y0 w1 h 1" alt =""
Từ khóa: