Báo cáo toán học: "A multivariate interlace polynomial and its computation for graphs of bounded clique-width" docx
Báo cáo toán học: "A multivariate interlace polynomial and its computation for graphs of bounded clique-width" docx
... algorithms for evaluations and
for computations of bounded portions of the interlace polynomials for graphs in classes
of bounded tree-width and more generally of bounded clique-width. The proof uses ... bounds for the interlace polynomial C and its specializations.
Theorem 23 is actually a corollary of Theorem 31.
Proof of Theorem 23:
For each k,...
Báo cáo hóa học: " A Novel Self-aligned and Maskless Process for Formation of Highly Uniform Arrays of Nanoholes and Nanopillars" pot
... shows that the variation of the FWHM
of the focused light is about 0.7% of the change of sphere’s
diameters. Highly uniform micro- and nanospheres with a
standard deviation of about 1.3% can be obtained ... uniform HCP nanoholes and nanopillars of
photoresist for lift-off process, as shown in Fig. 5a and b.
These metal nanoposts and nanoholes can be potentially
applied i...
Báo cáo khoa học: "Categorial Fluidity in Chinese and its Implications for Part-of-speech Tagging" pptx
... theoretical and prac-
tical concerns via the design of the tagset. In that
case the final lexicon would be theoretically valid
on the one hand, and the tagged corpus would be
of practical use for NLP ... each tag consists of a
letter code for the general classification (i.e.
noun, verb, etc.) of the word, and another for the
sub-classification according to the particular c...
Báo cáo toán học: "A Multivariate Lagrange Inversion Formula for Asymptotic" pps
... formula, obtaining a variety
of proofs and extensions. Gessel [4] has collected an extensive set of references. For
more recent results see Haiman and Schmitt [6], Goulden and Kulkarni [5], and
Section ... Bass, Connell, and Wright [1].
the electronic journal of combinatorics 5 (1998), #R33 3
2. Proof of Theorem 2
Expand the determinant δ
i,j
− a
i,j
. For each subset...
Báo cáo toán học: " A virtual infrastructure based on honeycomb tessellation for data dissemination in multi-sink mobile wireless sensor networks" pot
... as a rendezvous region for the queries and the generated data.
Therefore, it enables the gathering of all of the generated data in the network and
permits the performing of certain data optimizations ... other hand, for larger number
of sink-source pairs, the central region consisting of center cell and the cells at
the first and/ or second hexagonal rings can achieve bett...
Báo cáo toán học: " A Macdonald Vertex Operator and Standard Tableaux Statistics for the Two-Column (q, t)-Kostka Coefficients" doc
... functions for the standard
tableaux of size |µ| in the sense that H
µ
[X; q, t]=
T
q
a
µ
(T)
t
b
µ
(T)
s
λ(T)
[X] where the
sum is over standard tableau of of size |µ|. We give a formula for a ... function for
standard tableaux of size 2a + b (and hence that K
λ(2
a
1
b
)
(q, t)isapolynomialwith
non-negative integer coefficients). The inductive proof gives an algorithm for ’bui...
Báo cáo toán học: "A note on exponents vs root heights for complex simple Lie algebras" pot
... le
0
+
α∈∆
+
(e
α
+ e
−α
) and
2. From equation (1), the power series for ξ has constant term 1 and only involves
terms of the form e
−γ
for γ ∈ Q
+
.
Thus,
coeff. of e
0
in χ
˜α
ξ = l +
α∈∆
+
( coeff. of e
−α
in ... subalgebras of g and by Macdonald [4] via his
factorization of the Poincar´e series of the Weyl group of g.
The motivation for our approach to proposi...
Báo cáo toán học: "A New Method to Construct Lower Bounds for Van der Waerden Numbers" pdf
... Clauses that force each number j to be in exactly one subset C
i
; and
(2) clauses that forbid numbers in a subset to form an arithmetic progression of length k.
For a detailed description of these ... new proof of Szemeredi theorem. In Geometric and Functional Analysis.
Vol. 11, pages 465–588, 2001
[9] R. N. Greenwell and B. M. Landman, On the existence of a reasonable upper...
Báo cáo toán học: "A note on polynomials and f -factors of graphs" docx
... largest
hyperedge.
The proofs of Theorems 1 and 2 involve the use of the combinatorial nullstellensatz [2].
the electronic journal of combinatorics 15 (2008), #N22 2
A note on polynomials and f-factors of graphs
Hamed ... f(v) for all v ∈ V . In the case |f (v)| = 1, Tutte’s f -factor theorem gives a
necesary and sufficient condition for the existence of an f-factor of G...
Từ khóa: