Báo cáo tin học: "On the Spectrum of the Derangement Graph" pptx
Tài liệu Báo cáo khoa học: "On Learning Subtypes of the Part-Whole Relation: Do Not Mix your Seeds" pdf
... similarity.
In Proceedings of the Joint Conference of the 47th
Annual Meeting of the ACL and the 4th International
Joint Confe rence on Natural Language Processing
of the AFNLP, pages 396–404.
G.A. ... comparing the
results of these three sets among themselves, and
with the results of the member -of and contained-
in seeds, indicating insignificant similarity and
o...
Báo cáo tin học: "Two Coefficients of the Dyson Product" pps
... proofs may lead the way for
the cubic cases.
The study of the q-analogs of these formulas will follow a completely different route
and will not be discussed in this paper.
Acknowledgments. The ... as Theorem 1.2.
The proofs will be given in Section 2. In Section 3, we construct several interesting
Dyson style constant term identities.
2 Proof of Theorem 1.2 and Theorem 1.3
Go...
Báo cáo toán học: "On a Class of Constant Weight Codes" pptx
... All these facts
might be useful in statistics.
In the fourth section of the paper we shall prove the ‘quasi-random’ character
[4] of the distribution of the 0’s and 1’s in the codewords of the ... codes belonging to two known classes, namely that of
the duals of the double error correcting BCH codes, and that of the duals of the
Melas codes.
2. The basi...
Báo cáo tin học: "On a covering problem for equilateral triangles" pptx
... coverings of the unit square with homothetic smaller squares and
ask the same question. It turns out that the answer is the same, but the proof is much simpler;
we give the details in the last ... vertex; the side length of the special
triangle is the maximum side length of the replaced triangles. Note that the special triangle
constructed still covers the part...
Báo cáo toán học: " On cubic planar hypohamiltonian and hypotraceable graph" pptx
... cycle, such that there are f
i
i-gons in the exterior
of the Hamiltonian cycle and f
′
i
i-gons in the interior of the Hamiltonian cycle. Then
i
(i − 2)(f
i
− f
′
i
) = 0. (1)
The theorem can be ... Hamiltonian cycles of the vertex-deleted subgraphs of G
the electronic journal of combinatorics 18 (2011), #P85 7
Figure 4: Hamiltonian cycles of the vertex- deleted...
Báo cáo tin học: "On the Spectrum of the Derangement Graph" pptx
... discussion of the characters of the symmetric group. Using a result of
Stanley we relate these to symmetric function theory and compute a rough bound on the
eigenvalues. We then employ the factorial ... χ
U
.
χ
V
(σ) just counts the number of fixed points of σ, so
χ
W
(σ) = #{fixed points of σ} − 1. (2.1)
From (2.1) and Theorem 2.1 the eigenvalue of the derangement...
Báo cáo hóa học: " Research Article Spectrum of Compact Weighted Composition Operators on the Weighted Hardy Space in the Unit Ball" potx
... C
∗
ψ,ϕ
is the union of the spectrum of A
m
and the spectrum of C
m
[1,page
270]. Since A
m
is a finite dimensional upper-triangular matrix, its spectrum is the eigen-
value of A
m
. By the arguments ... unit ball, then the spectrum of C
ψ,ϕ
is the set
0,ψ(a),ψ(a)μ
, (2.19)
where μ is all p ossible products of ϕ
(a) and a is the only fixed point of ϕ....
Báo cáo hóa học: " Research Article Spectrum of Compact Weighted Composition Operators on the Weighted Hardy Space in the Unit Ball" doc
... C
∗
ψ,ϕ
is the union of the spectrum of A
m
and the spectrum of C
m
[1,page
270]. Since A
m
is a finite dimensional upper-triangular matrix, its spectrum is the eigen-
value of A
m
. By the arguments ... some
clarification in the case of spaces defined on B
N
(N>1) as the Denjoy-Wolff point may
not be well defined. In the proof of Lemma 2.1, a technique is insp...
Báo cáo tin học: "On the quantum chromatic number of a graph" pps
... {0, 1, 2, 3}
3
giving
the power of i in each component of s, and list the vertices of S in lexicographic order.
Then a 4-colouring of the orthogonality graph on S is given by the following:
(1, ... win the graph colouring game in the above setting, w.l.o.g. the state is
maximally entangled, and the POVM elements are all projectors, all w.l.o.g. of the same
rank.
Pr...
Báo cáo tin học: "On the Resilience of Long Cycles in Random Graphshan" ppsx
... used that, by the choice of ε and δ, we have
2δ = 2ε
µ
−1
+
−1
≤
1
4
µ( + µ) ≤
1
4
.
This concludes the proof of Lemma 10.
3 Proofs of Theorems 7 and 8
We present the proof of Theorem 7 in ... proves the upper bound for r
l
in Theorem 8.
3.2.2 Proof of the lower bound for r
l
We give the proof of the lower bound in Theorem 8 in this section. Suppose G is
a (p,...
Từ khóa: