Báo cáo toán học: "Bounds for the average Lp-extreme and the L∞-extreme discrepancy" pptx
Báo cáo toán học: "Bounds for the average Lp-extreme and the L∞-extreme discrepancy" pptx
... 5
Remark 4. The probabilistic argument we used for deriving our upper bound for the
average L
p
-extreme discrepancy was sketched in [11]. Unfortunately the derivation there
contains an error (the number ... similar way we can use the bound for the average L
p
-star discrepancy
to calculate an upper bound for the inverse n
∗
∞
(d, ε) of the star discrepancy: With (2...
Báo cáo toán học: "Bounds for the H¨ckel energy of a graph u" pptx
... (1) and (4) for graphs of an odd order and discuss the equality
case and tightness of the bounds.
Theorem 4. Let m n −1 3 and G be a graph with n vertices and m edges where n
is odd. Then ... parameters. Note that
for t = 1, there exists only one such a graph namely the Johnson graph J(5, 2), for t = 2
there are 10. For t 9 they do exist and t = 10 seems the...
Báo cáo toán học: "Bounds for DNA codes with constant GC-content" pdf
... nucleotide at x
2m−j+1
is forced by the choice of x
j
; for the
other w − 2i positions j ≤ m, there are two choices for the nucleotide x
2m−j+1
.
In (14), the first summand gives the number of words ... argument as in [19], for example. Hence
the right-hand-side of (9) is an upper bound for the sum of the M
2
pairwise Hamming
distances. For the left-hand-side, note...
Báo cáo toán học: "Operations on Well-Covered Graphs and the Roller-Coaster Conjecture" docx
... graphs. Then the disjoint union G
1
G
2
is also well-
covered. Furthermore, we have the following formula for the independence number of the
resulting graph:
S(G
1
G
2
,z)=S(G
1
,z)S(G
2
,z).
For ... Pascal’s
Triangle.
For a given α,letw
n
denote the nth term in the sequence [S(F
α
,z)]. Assume in
Table 2 that α
o
=0andalsosetk
i
= 1 for i ≤ 1, and k
i
= 0 for i>...
Báo cáo toán học: " Character Polynomials, their q-analogs and the Kronecker product" potx
... combinatorial formula for the character polynomials which has some
kinship with the Murnaghan-Nakayama rule, and is quite suitable for hand calculations.
Theorem I.1 For a given µ ⊢ k, let bd(i, µ) be the ... the convention h
a
= 0 when a < 0, the inductive hypothesis and equation
5.14 give for all m:
k h
m−k
= p
⊥
k
h
m
+ (k − 1)h
m−k
that is p
⊥
k
h
m
= h
m−k
and...
Báo cáo toán học: "Jack deformations of Plancherel measures and traceless Gaussian random matrices" pptx
... which evinces the connection
between Plancherel random partitions and GUE random matrices.
In random matrix theory, there are two much-studied analogues of the GUE matrix,
called the Gaussian ... orthogonal (GOE) and symplectic (GSE) ensemble random matrix,
see standard references [Fo, Me]. The probability density function for the eigenvalues of
the GOE and GSE matrix is p...
Báo cáo toán học: "Asymptotics for the Probability of Connectedness and the Distribution of Number of Components Jason P. Bell Department of Mathem" doc
... verify.
Forests of various sorts provide easy examples for the application of Theorem 2. These
and other graphical examples are discussed by Compton [10] and by Knopfmacher and
Knopfmacher [18] in their ... nature of the power series for
the structures: purely formal, convergent on the circle of convergence, and other. We
determine all possible values for the pair (lim...
Báo cáo toán học: "Asymptotics for the distributions of subtableaux in Young and up-down tableaux" pps
... three groups. The step e
1
is the fundamental weight ˇω
1
for B
n
and
D
n
,ande
1
and −e
1
project to the fundamental weights ˇω
1
and ˇω
n−1
for A
n−1
.
3 Asymptotics for random walks and Brownian ... zero, and because
the sums are infinite sums and the sum of the finite errors is not bounded.
For simplicity, we will work out the case (32) in full for the...
Từ khóa: