Báo cáo toán học: "An abstract Kato inequality for generators of positive operators semigroups on Banach lattices " doc
Báo cáo toán học: "An abstract Kato inequality for generators of positive operators semigroups on Banach lattices " doc
... class="bi x0 y1 w1 h 2" alt =""
Báo cáo toán học: "A polar area inequality for hyponormal spectra " pptx
... class="bi x0 y1 w2 h 2" alt =""
Báo cáo toán học: "A Gagliardo-Nirenberg Inequality for Lorentz Spaces" pps
... developing the method of [1] and [10], we give
an extension of the Gagliardo-Nirenberg inequality to Lorentz spaces.
Let Φ : [0, ∞) → [0, ∞) be a non-zero concave function, which is non-decreasing
and ... conclusion the author would like to thank professor Ha Huy Bang for the
helpful suggestions.
References
1. H. H.Bang and M.T.Thu, A Gagliardo-Nirenberg inequality for Orlicz spac...
Báo cáo toán học: "An improved tableau criterion for Bruhat order" ppt
... for all i ∈ E.
Proof. For I = this is Lemma 3.6 of Deodhar [D, p. 195]. His result takes care of the
⇒ direction. His proof of the ⇐ direction is by induction on (y). The induction step (the
laborious ... x ≤ y only d
1
+ d
2
+ + d
k
of these comparisons are
needed, where {d
1
,d
2
, ,d
k
} = {i|x(i) >x(i +1)}. This is obtained as a consequence
of a sharper version of De...
Báo cáo toán học: " AN EXACT PERFORMANCE BOUND FOR AN O(m + n) TIME GREEDY MATCHING PROCEDURE" pptx
... algorithm alone. The
lower bound on γ(G) is a stronger version of Erd¨os and Gallai’s result, and so the
proof of the lower bound is a new way of proving of Erd¨os and Gallai’s result.
the electronic ... matching
algorithms can be improved upon by explicitly using this technique.
An outline of the remainder of this paper is as follows. Section 2 contains defini-
tions and notatio...
Báo cáo toán học: "The Tur´n problem for hypergraphs of fixed size " ppsx
... and Rado [5] conjectured that for any t there is a
constant C so that any r-uniform hypergraph with C
r
edges contains a sunflower with t
edges. We can obtain a bound of this form for forests, indeed, ... o(1))(2r!
2/r
f
3−2/r
)
−1
,for xedr ≥ 3andf →∞.
Given an r-uniform hypergraph F,theTur´an number of F is the maximum number
of edges in an r-uniform hypergraph on n vertices tha...
Báo cáo hóa học: " Research Article Geometry Unit for Analysis of Warped Image Features on Programmable Chips" ppt
... backward transformation and in-
terpolation of the arbit rarily formed image regions. In this
context, a region is defined as a set of points. Therefore,
a specific region is described by a list of (target) ... transformation can be of interest
for some applications, for example, to rectify perspectival de-
formations as they appear in images of cylindrical objects.
(iii) The geom...
Báo cáo toán học: "An Inequality Related to Vizing’s Conjecture" docx
... set of G. Form a partition {Π
1
, Π
2
, ,Π
γ(G)
}
of V (G) so that for all i:(i)u
i
∈ Π
i
, and (ii) u ∈ Π
i
implies u = u
i
or u is adjacent
to u
i
. This partition of V (G) induces a partition ... product of graphs, Vyˇcisl. Sistemy 9, 1963, 30–43.
the electronic journal of combinatorics 7 (2000), #N4 2
Theorem 1 For any graphs G and H,
γ(G)γ(H) ≤ 2γ(G H).
Proof. Let D be a...
Báo cáo toán học: " An overview of learning mechanisms for cognitive systems EURASIP Journal on Wireless Communications and Networking " pot
... Their interrelation lies
in the fact that the combination of a dynamical learning of context
information and user preferences could be exploited in a later stage for the
selection of the most appropriate ... in conditional probability tables (CPTs) of the form of Table 1. In
these CPTs each column represents a different configuration while each row
corresponds to a different...
Từ khóa: