Báo cáo toán học: " New Lower Bounds for Some Multicolored Ramsey Numbers" pot
Báo cáo toán học: " New Lower Bounds for Some Multicolored Ramsey Numbers" pot
... triangles.
Harvesting Some Lower Bounds for Ramsey Numbers
It is amazing that the result of this section has not been observed for the 25 years
since [C] was published. Using this observation we will give 6 new lower ... 87-95.
[R] S. Radziszowski, Small Ramsey Numbers, Electronic Journal of Combinatorics,
Dynamic Survey DS1, 1994, 28pp.
[S] Song En Min, New Lower Bound...
Báo cáo toán học: "New lower bounds for Heilbronn numbers" pps
... determination of optimal values and lower
bounds for every H
n
. Besides the trivial cases H
3
and H
4
, Golberg showed constructions
providing lower bounds for n ≤ 15. A.W.M. Dress, Yang Lu, ... value for H
5
.Theyalso
improved the lower bound for H
7
.
In this note, and by using a simple implementation of simulated annealing and a further
optimization procedure, we present...
Báo cáo toán học: "New lower bound for multicolor Ramsey numbers for even cycle" doc
... analogously. We refer the reader to [6] for a
survey.
2 The Ramsey numbers for even cycles
Up to now, there have been known only two exact values for 3-color Ramsey numbers for
even cycles. More precisely, ... Moreover, by using upper bound for
Ramsey number for even cycles ([5, Section 5.7, Theorem 10]), we have R
3
(C
8
) ≤ 2412,
and by using known upper bound for Ramse...
Báo cáo toán học: "Determining Lower Bounds for Packing Densities of Non-layered Patterns Using Weighted Templates" pps
... 2413-occurrences. In this paper, we will improve
this lower bound and introduce a generalized method involving weighted templates as a
way for computing lower bounds for δ(π), the packing density of a non-layered ... proportion of subsequences of σ ∈ S
n
that are order-isomorphic to π.
We generalize methods for obtaining lower bounds for the packing density of any
pattern an...
Báo cáo toán học: "New Upper Bounds for the Size of Permutation Codes via Linear Programmin" pdf
... upper bounds on µ(n, d) appears in Deza and Frankl [10]:
Theorem 1. For n 3 and d n,
µ(n, d) n µ(n − 1, d)
and therefore
µ(n, d)
n!
(d − 1)!
In this paper, we will establish new bounds for ... method to
obtain new upper bounds for µ(n, d).
2 Isometries
A distance D on S
n
is called left-invariant (resp. right-invariant) if D(φ, ψ) = D(αφ, αψ)
(resp. D(φ, ψ) = D(φα, ψα)...
Báo cáo toán học: "New Lower Bound Formulas for Multicolored Ramsey Numbers" pptx
... two lower bound formulas for multicolored Ramsey numbers. These formu-
las improve the bounds for several small multicolored Ramsey numbers.
1. INTRODUCTION
In this short article we give two new ... color j for j =1, 2, ,r.ForV = R − 1 we call the coloring a maximal Ramsey
r-coloring.
2. THE LOWER BOUNDS
We start with an easy bound which nonetheless improves upon so...
Báo cáo toán học: " Tight performance bounds for two-way opportunistic amplify-and-forward wireless relaying networks with TDBC protocols" ppt
... obtain
the closed-form analytical solutions to CDF and PDF of
the end-to-end SNR for TWOR-AF-Nodir systems, and
present the corresponding tight lower bound. Though
the tight lower bounds are obtained ... 2011:192
http://jwcn.eurasipjournals.com/content/2011/1/192
Page 5 of 8
RESEARCH Open Access
Tight performance bounds for two-way
opportunistic amplify-and-forward wireless
relayi...
Báo cáo toán học: "A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers of K3" doc
... 1994; Accepted: September 18, 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 k...
Báo cáo toán học: "TIGHT UPPER BOUNDS FOR THE DOMINATION NUMBERS OF GRAPHS WITH GIVEN ORDER AND MINIMUM DEGREE" pdf
... value of γ(n, δ) for n ≤ 16, 0 ≤ δ ≤ n − 1 if the value is
known, otherwise upper and lower bounds for γ(n, δ). We establish these values in
Sections 2, 3 and 4.
TIGHT UPPER BOUNDS FOR THE DOMINATION ... Anderson, Combinatorics of Finite Sets, Clarendon Press, Oxford,, New York, 1987
2. W. E. Clark, D. Fisher, B.Shekhtman and S. Suen, Upper bounds for the domination number...
Báo cáo toán học: "Improved Upper Bounds for Self-Avoiding Walks in Zd" ppt
... 2.6939
18 2.6880
20 2.6832
22 2.6792
Table 2: Upper bounds for the connective constants µ
(d,k)
for walks with
finite memory. The values shown are true upper bounds.
4 Acknowledgements
We thank Tony Guttmann ... 82B41, 05A15
Abstract
New upper bounds for the connective constant of self-avoiding
walks in a hypercubic lattice are obtained by automatic generation
of finite automata...