Báo cáo toán học: "The Cover Time of Deterministic Random Walks" ppt
Báo cáo toán học: "The Cover Time of Deterministic Random Walks" ppt
... Comparison of the edge cover time of random and deterministic walk on different
graphs (n = |V |).
is known that the edge cover time of random walks can be asymptotically larger than
its vertex cover time. ... Comparison of the vertex cover time of random and deterministic walk on different
graphs (n = |V |).
graph is Θ(|V |log |V |). In addition, many papers...
Báo cáo toán học: " The Translational Hull of a Strongly Right or Left Adequate Semigroup" pdf
... set P (S) of all right translations) of the semigroup
S forms a semigroup under the composition of mappings. By the translational
hull of S, we mean a subsemigroup Ω(S) consisting of all bitranslations ... Journal of Mathematics 34:4 (2006) 441–447
The Translational Hull of a Strongly Right
or Left Adequate Semigroup
X. M. Ren
1
*
and K. P. Shum
2
+
1
Dept. of Mathematics, Xi’...
Báo cáo toán học: "The Quantum Double of a Dual Andruskiewitsch-Schneider Algebra Is a Tame Algebra" pdf
... general-
ization of [7], of (A(n, d, μ, q))
∗cop
. Our main result is to give the structure of
projective modules of D(Γ
n,d
). By this, we give the Ext-quiver (with relations)
of D (Γ
n,d
)andshowthatD(Γ
n,d
) ... >
−
−1, the elements X
s
K
u,j
and
X
s
F
u,j
are linearly independent.
Proof. The proof of this lemma is same to the proof of Lemma 2.18 in [7]. For
completeness...
Báo cáo toán học: "The independence number of graphs with large odd girth" ppt
... vertex cover of a graph G is a set of vertices U so that for every edge ab ∈ E(G)
a or b is a member of U . We shall write λ(G) for the minimum size of a vertex
cover of G.
The vertex cover problem ... mimic the proof of Theorem 1 , but
this time we choose
m =
n
8(k −1)
δ −
2
¯
d(G)
3
−1
1
k
.
Firstly let us greedily colour the vertices of G just as we did in The...
Báo cáo toán học: "THE INDEPENDENCE NUMBER OF DENSE GRAPHS WITH LARGE ODD GIRTH" ppsx
... cycles. Let
¯
d be the average degree of
vertices of G.Then
α(G) ≥
n
¯
d/2.
Proof. Since G contains no 3 or 5 cycles, we have α(G) ≥ d
1
(v) (consider the neighbors
of v)andα(G) ≥ 1+d
2
(v) (consider ... graphs of larger odd girth.
Lemma 2: Let G have odd girth 2k + 1 or greater (k ≥ 2). Then
α(G) ≥
v∈G
1
2
(1 + d
1
(v)+···+ d
k−1
(v))
1+d
1
(v)+···+ d
k
(v)
.
Proof. Randomly labe...
Báo cáo toán học: "The asymptotic number of set partitions with unequal block sizes" pot
... values of n, we shall use elementary estimates and some well-known bounds
for ordinary partitions (of a number) to express most values of b
n
in terms of the number
of ordinary partitions of k ... the number of partitions of (the number) n,andQis its ordinary
generating function. Also, define p(n, k) to be the number of partitions of n with largest
part at most k. We will ha...