Báo cáo toán học: " Large equiangular sets of lines in Euclidean space" pptx
Báo cáo toán học: " Large equiangular sets of lines in Euclidean space" pptx
... set. Such
maximal non-singular sets do exist for all t.
We may now describe the graphs occurring in our construction of equiangular lines.
Let K be a Kerdock set of alternating forms on V , where ... thus obtain an equiangular set of
2
9
(d +1)
2
lines in Euclidean d-space, whenever
d =3q − 1=3· 2
2t−1
− 1 for some positive integer t. This completes the presentation
and...
Báo cáo toán học: "On the Number of Matchings in Regular Graphs" pptx
... :=
r
i=1
A
i
. Let m ∈ min(p, q). Then perm
m
A is the number
of m-matchings of G := ∨
r
i=1
G
i
, which is equal to the number of m-matchings obtained
in the following way. Consider m
1
, . ... shows the inequality between the last term of the
first line and the first term in the second line of (3.10). ✷
For graphs consisting of more than two cycles or paths there is no tot...
Báo cáo toán học: "On Feasible Sets of Mixed Hypergraphs" doc
... D-edges of size two. Hence, H is one-realization of F.The
number of vertices of H is at most 1 + |F
| +2maxF
− min F
≤|F|+2maxF−min F.
It remains to consider the case when min F =2. ThecaseofF ... are in
one-to-one correspondence with proper (+1)-colorings of H
, since the color of the vertex
x has to be different from the color of any other vertex and it does not affec...
Báo cáo toán học: " Review article: Use of ultrasound in the developing world" potx
... during multiple natural disasters in the past 2
decades, including the earthquake in Armenia in 1988 [35], Wenchuan, China, in 2008
[36], and Haiti in 2010 [37], and the tsunami in Indonesia in ... I, et al.: Development of an ultrasound training
curriculum in a limited resource international setting: successes and
challenges of ultrasound training in rural Rwanda. I...
Báo cáo toán học: "The linear span of projections in simple C*-algebras " pot
... class="bi x0 y0 w2 h 1" alt =""
Báo cáo toán học: "Multi-statistic enumeration of two-stack sortable permutations" pptx
... by handling the simplest (and original)
the electronic journal of combinatorics 5 (1998), #R21 2
only algorithm that leaves a hope to obtain the letters of σ in the output in increasing order ... be done, using the series Y introduced in the proof of
Proposition 2.1. We obtain the number of two-stack-sortable permutations of length n having m right-to-
left maxima, as given i...
Báo cáo toán học: "Bounding the number of edges in permutation graphs" pdf
... configurations of 1, t, l,andr in the diagram for π .Of
the electronic journal of combinatorics 13 (2006), #R44 5
Adjacency of an endpoint Adjacency of a typical
vertex in an s-run vertex in an (s/2)-run
Figure ... vertices in s-runs have internal degree 7s/2+2.
Since there are twice as many vertices in runs of length s as in runs of length s/2, the
total number of i...
Báo cáo toán học: "Using Lov´sz Local Lemma in the space of a random injections" pptx
... has a perfect matching.
Proof of Theorem 3: Let H
1
be the union of
n
s
vertex-disjoint copies of G and H
be the complement graph of H. Observe that H has a perfect G-packing if and only if
H
1
and ... 1)m
1
<
1
e
n
r
, then there exist injections of V (H
1
) and V (H
2
) into K
(r)
n
such that the natural
images of H
1
and H
2
are edge-disjoint.
Proof: Without loss of ge...
Báo cáo toán học: "On the size of minimal unsatisfiable formulas" pptx
... y
2l
= true) will make the remaining
clauses true.
Next we prove the linear upper bound of number of clauses in minimal unsatisfiable
2-SAT formulas.
Proposition 1. Minimal unsatisfiable 2-SAT formulas ... Journal of Combinatorial Theory, Series A 43, 1986, p196-204
[2] B. Aspvall, M. F. Plass, R. E. Tarjan, A linear-time algorithm for testing the truth of
certain quantified boolean fo...
Báo cáo toán học: "On the distribution of depths in increasing trees" ppsx
... . , n} in such a way that the sequence of labels along
any branch starting at the root is increasing. There are various important families of
increasing tr ees, such as binary increasing trees, ... distribution of the depth of the lowest common
ancestor of two nodes.
1 Introduction
Increasing trees are rooted labeled trees where the nodes of a tree of size n are labeled by
dis...