Báo cáo toán học: "NEW UPPER BOUNDS ON THE ORDER OF CAGES1" pps
Báo cáo toán học: "NEW UPPER BOUNDS ON THE ORDER OF CAGES1" pps
... were constructed in [9] by F¨uredi, Seress, and the authors.
The fact that the orders of these constructions actually meet the upper bound in
(2) for q odd follows from [13]. The constructions ... that these upper bounds are roughly the squares of the previously indicated
lower bounds.
In this paper we establish general upper bounds on v(k, g) which are roughly...
Báo cáo toán học: "TIGHT UPPER BOUNDS FOR THE DOMINATION NUMBERS OF GRAPHS WITH GIVEN ORDER AND MINIMUM DEGREE" pdf
... Propostion 4.1 below to reduce the determination
of γ(10, 5) to the determination of γ
r
(10, 5). Then we search through all 5-regular
graphs of order 10 to find that γ
r
(10, 5)=2.
the electronic ... contains the 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...
Báo cáo toán học: "Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II." pdf
... also consider the case k = 3 in more detail. There are
various known upper bounds of γ(n, δ) (see for example [3]). The upper bound γ
∗
(n, δ)in
Theorem 2 below differs only trivially from the upper ... ≥ k by definition of δ
k
(n). The theorem
therefore follows.
In the next section we show that if k = 3 then the above theorem holds for n ≥ 6.
Note that the results in...
Báo cáo toán học: "New upper bound for a class of vertex Folkman numbers" pptx
... Lemma 1 we conclude that
The number of the vertices of each connected
component of
¯
G
1
is an even number;
(15)
and
the number of the vertices of exactly one of the
connected components of
¯
G
2
is ... connected components. It is
clear that
¯
G
2
also has at least two components. From (16) we have that the number of
the vertices of at least one of the comp...
Báo cáo khoa học: "Empirical Lower Bounds on the Complexity of Translational Equivalence ∗" pdf
... word
on one side linked to every word on the other side),
then we added links from each of these words to
NULL. Second, if n words on one side of the bi-
text aligned to m words on the other ... other
hand, if a constraining tree is applied to the other
sentence as shown in Figure 2b, then the word
alignment and tree constraint conflict. The projec-
tion of the VP i...
Báo cáo toán học: " New Lower Bounds for Some Multicolored Ramsey Numbers" pot
... the
definition of T
r+2
.
Remark: Up to the renaming of colors and vertices, the above permutation configura-
tion of colors which defines T
r+3
is the only configuration which will avoid monochro-
matic ... will output 1.
the electronic journal of combinatorics 6 (1999), #R3 5
by the construction of T
r+3
we see that all of these entries can be taken modulo M −1,
since t...
Báo cáo toán học: "Improved Upper Bounds for Self-Avoiding Walks in Zd" ppt
... following ex-
planations.
3 Upper bounds for the connective constant
The dimension of the system of equations complicates the explicit construc-
tion of the generating function for walks with memory greater ... number of walks in each of
the states of the strongly connected component. Reducing the automaton to
the states in the strongly connected component...
Báo cáo toán học: "New lower bounds for Heilbronn numbers" pps
... stationary
points of f, see [5] for more details. The fulfilment of this condition together with the
context of the situation serves to characterise the local maxima of f.
As an illustration of the ... A point here corresponds to a concrete configuration of the Heilbronn prob-
lem. The linearity dependence condition provides m − k equations that together with
the k e...
Báo cáo toán học: "Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size" doc
... preceding it in the clockwise orientation and q the distance along the rim
from n
p,κ
. We place the following restriction on the spokes of the wheel, indicating this
through the subscripts of the spoke-nuts.
Rule ... an upper bound for the function sat(n, C
l
) that improves the upper
bound given in [1] for most values of l. We improve the upper bound via...
Báo cáo toán học: " UWB system based on energy detection of derivatives of the Gaussian pulse" potx
... increasing the order of
the derivatives [13]. Also, the spectral separation of a
pulse pair can be increased by increasing the difference
of the orders of the derivatives. Although the implemen-
tation ... re the equations o f the 10th- and
30th-or der derivativ es of the Gaussian pulse. These two
equations are the simplified versions of the original ones...
Từ khóa:
- các báo cáo toán học hay
- báo cáo toán học hay
- empirical lower bounds on the complexity of translational equivalence
- new normal notes on the future of preparedness
- influence on the order of operations with default statistics
- influence on the order of operations
- báo cáo khoa học toán học
- ngô bảo châu amp đỉnh cao toán học