Báo cáo toán học: "A Sperner-Type Theorem for Set-Partition Systems" ppsx
Báo cáo toán học: " A novel method for crystalline silicon solar cells with low contact resistance and antireflection coating by an oxidized Mg layer" ppt
... appeared upon acceptance. Fully formatted
PDF and full text (HTML) versions will be made available soon.
A novel method for crystalline silicon solar cells with low contact resistance and
antireflection ... in any medium, provided the original work is properly cited.
A novel method for crystalline silicon solar cells with low contact resis...
Báo cáo toán học: " Weak convergence theorem for the three-step iterations of non-Lipschitzian nonself mappings in Banach spaces" pptx
... (2004)
doi:10.1186/1687-1812-2011-106
Cite this article as: Zhu et al.: Weak convergence theorem for the three-step iterations of non-Lipschitzian
nonself mappings in Banach spaces. Fixed Point Theory and Applications 2011 2011:106.
Submit ... Shahzad, N: Convergence theorems for a common fixed point of finite family of nonself
nonexpansive mappings. Fixed...
Báo cáo toán học: " Central Limit Theorem for Functional of Jump Markov " pptx
... x).
Central Limit Theor em for Functional of Jump Markov Processes 447
with
Var (u
k
|F
k−1
)=[E(u
ik
u
jk
|F
k−1
),i,j =1, 2, ···,m].
We shall prove the following theorem.
Theorem 2.4. (Central ... + C
with C being any constant, since
Central Limit Theor em for Functional of Jump Markov Processes 459
Theorem 3.3. Assume that the condition (C
1
) of Theo...
Báo cáo toán học: "A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers of K3" doc
... 1994
Abstract
For k ≥ 5, we establish new lower bounds on the Schur numbers S(k)
and on the k-color Ramsey numbers of K
3
.
For integers
m
and
n
,let[
m, n
]denotetheset{
i
|
m
≤
i
≤
n
}.AsetSof
integers ... published bounds for
S
(5) are 157 ≤
S
(5) ≤ 321, the lower bound
was proved in [4] and the upper bound in [6]. For Ramsey numbers we know
R
2
(3) = 6...
Báo cáo toán học: " A NEW CONSTRUCTION FOR CANCELLATIVE FAMILIES OF SETS" doc
... the union of any element of F
1
with any element of
F
2
.
It is easy to see that the product of two cancellative families is also a cancellative
family ( (A
1
,A
2
) ∪(B
1
,B
2
)= (A
1
,A
2
) ∪(C
1
,C
2
) ... ask how large cancellative families can be. We define f(n) to be the size of the largest
possible cancellative family of subsets of a n-set and f(k,n)...
Báo cáo toán học: "A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16" pptx
... 1996
Abstract
A method for constructing cubic graphs with girths in the range 13 to 16 is described. The
method is used to construct the smallest known cubic graphs for girths 14, 15 and 16.
Introduction
We ... JournalofGraphTheory,6, 1982, 1-22.
A Simple Method for Constructing Small Cubic Graphs of Girths
14, 15, and 16
Geoffrey Exoo
Departm...
Báo cáo toán học: "A Plethysm Formula for pµ (x) ◦ hλ (x) William F. Doran IV Department of Mathematics California Institute of Technology Pasadena, CA 91125" doc
... A Plethysm Formula for p
à
(x) h
(x)
William F. Doran IV
Department of Mathematics
California Institute of Technology
Pasadena, CA 91125
doran@ cco.caltech.edu
Submitted: ... )
are given in Table 1.
So, p
(2)
(x) ◦ h
(2,1)
(x)= s
(6)
(x) − s
(5,1)
(x)+ 2s
(4,2)
(x) − 2s
(3,3)
(x) − s
(4,1,1)
(x)+
s
(2,2,2)
(x)+ s
(3,1,...
Báo cáo toán học: "A simple algorithm for constructing Szemer´di’s Regularity Partition e" pps
... A simple algorithm for constructing
Szemer´edi’s Regularity Partition
Alan Frieze
Department of Mathematical Sciences,
Carnegie ... combinatorics 6 (1999), #R17 3
A partition satisfying the second criterion is called equitable. V
0
is called the
exceptional class.
Following [9], for every equitable partition P into k +1classes ... (ˆx
+
)
T
Wˆy
−
≥ ˆγ
√
pq/4. (The proof
for...
Báo cáo toán học: "A reciprocity theorem for domino tilings" pptx
... extended to T(m,n) for all m.
It is worth remarking that the reciprocity theorem satisfied by the Laurent polynomials
M(
(m,n)) is a bit more complicated than the reciprocity theorem satisfied by ... is worth mentioning here that Cohn has proved a different reciprocity theorem for domino
tilings [1]; it is unclear to me whether his Theorem 1 is related to the result treated...
Báo cáo toán học: " he Local Theorem for Monotypic Tilings" ppsx
... (that is, locally).
In a sense, the new theorem sits between the Local Theorem for Tilings and the so-
called Extension Theorem; the latter, in turn, is based on the Local Theorem for Tilings
and ... so there can only be a finite number of proper ascents in (2.2).
3 The Local Theorem for Monotypic Tilings
The following Local Theorem for Monotypic Tilings is a com...
Báo cáo toán học: "MacMahon’s theorem for a set of permutations with given descent indices and right-maximal record" ppt
... electronic journal of combinatorics 17 (2010), #R34 10
MacMahon’s theorem for a set of permutations with
given descent indices and right-maximal records
A. Dzhumadil’daev
Institute of Mathematics, Pushkin ... by
r[max, i](σ) the set of all right-maximal indices of σ, and let r[max, v](σ) denote the set of
all right-maximal values. Note that any...
Từ khóa: