Báo cáo toán học: "The edge-count criterion for graphic lists" doc
Báo cáo toán học: "The Garnir relations for Weyl groups of type Cn" pot
... (2008), #R73 1
is a simple system for C
µ
j
and therefore J
(2)
=
s
j=1
J
(2)
l
j
is a simple system for
s
j=1
C
µ
j
.
Thus, J = J
(1)
+ J
(2)
is a simple system for Ψ =
r
i=1
A
λ
i
+
s
j=1
C
µ
j
, ... of
the form −2e
i
for some i, and so −2e
i
∈ wJ
(2)
. Now, put −α
∗
= 2e
i
. Then by definition
of the set J
−α
∗
, all the elements of wJ
occur in J
−α
∗
except for the elem...
Báo cáo toán học: "The many formulae for the number of Latin rectangles" doc
... general formulae for L
k,n
and L
n
. For small n the
values of K
2,n
, K
3,n
and R
4,n
are given by Sloane’s [142] A000166, A000186 and A000573,
respectively. Exact formulae for L
k,n
for k ... French. Doyle’s formula for L
k,n
is
given in a closed form and is used to compute previously unpublished values of L
4,n
,
L
5,n
and L
6,n
. We reproduce the three formulae for L
k,n
by...
Báo cáo toán học: " The Embedding of Haagerup Lop Spaces" doc
... σ
ψ|N
t
for each t ∈ R. Then N, the crossed product of N ,
is canonically embeded into M and for each p ∈ [1, ∞] the space L
p
(N ) can be
canonically embeded into L
p
(M ), so that for any k ... e
−ist
λ
N
(t), ∀t, s ∈ R.
Thus θ
s
(y
0
) ∈ N
0
for y
0
∈ N
0
, ∀s ∈ R. So that θ
s
(N
0
) ⊂ N
0
⊂ N. Since θ
s
is
σ-weakly continuous on M; for all s ∈ R we have
θ
s
(N) ⊂ N.
The continui...
Báo cáo toán học: "A Scaling Result for Explosive Processes" docx
... with n balls obtains the next ball is proportional to f(n)
for some function f. For example, a common case to study is when f(n)=n
p
for some
constant p>1. Specifically, we consider the case ... remain open. For instance, are our methods applicable
to related non-linear models for Web graphs [3]? It seems likely that this problem requires
improvements on the error bounds for Gau...
Báo cáo toán học: "Bonferroni-Galambos Inequalities for Partition Lattices" doc
... Connected k-uniform hypergraphs
It is well-known (cf. [1, 10]) that for any n, k ∈ N the number c
n,k
of connected k-uniform
hypergraphs on vertex-set {1, ,n} is given by the formula
c
n,k
=
π∈ ... (U)
g(σ)
|σ|−1
r
r! .
Therefore, for any ω ∈ P(U),
S ≥
σ∈ (U)
σ≤ω
g(σ)
|σ|−1
r
r! ≥
σ∈ (U)
σ≤ω
g(σ)
|ω|−1
r
r!=f(ω)
|ω|−1
r
r! .
By choosing ω uniformly at random among al...