Báo cáo toán học: On coupling constant thresholds in two dimensions " ppt
Báo cáo toán học: " On the interchannel interference in digital communication systems, its impulsive nature, and its mitigation" docx
... article as: Nikitin: On the interchannel interference in digital
communication systems, its impulsive nature, and its mitigation.
EURASIP Journal on Advances in Signal Processing 2011 2011:137.
Submit ... originate at the ‘ smoothest ’,mostlinear
parts of the modulating signal. The next section clarifies
the origins of this impulsive nature of the out...
Báo cáo toán học: On coupling constant thresholds in two dimensions " ppt
... class="bi x0 y4 w1 h 8" alt =""
Báo cáo toán học: "On Efficient Sets in R" potx
... different
if the ordering cone C is not pointed. So one must be careful when applying
results in [4] for efficient points in the sense of (1) (as done in [2, p. 291]). For
instance, Corollary 3.11 ... is efficient w.r.t. C in the sense of (2), while A has no
efficient point w.r.t. C in the sense of (1).
The set of efficient points of A w.r.t. C is called efficient set and denoted by...
Báo cáo toán học: "On a conjecture concerning dyadic oriented matroids" pptx
... subdeterminants are in
{±2
k
: k ∈ Z}. An oriented matriod is dyadic if it has a totally dyadic represen-
tation A. A dyadic oriented matriod is dyadic of order k if it has a totally dyadic
representation A ... totally dyadic
representation A. A dyadic oriented matriod is dyadic of order k if it has a
totally dyadic representation A with full row rank a...
Báo cáo toán học: "Aviezri Fraenkel’s work in Number Theory" ppt
... the Chinese Remainder Theorem, a proof of which was
published by Aviezri early in his career [5].
A major problem in molecular biology is to determine the mechanism of protein folding.
In water, ... Aviezri,
shaking his head sadly, “I expected something like this would happen. Everyone is driving
the electronic journal of combinatorics 8 (no. 2) (2001), #I3 2
Aviezri Fraenkel’s work...
Báo cáo toán học: "On growth rates of closed permutation classes" ppt
... c
3
m
c
4
.
This finishes the proof of case B2, of claim B, and of the whole theorem. ✷
Every growth rate n → F
n,k
is attained by a closed class of permutations (take, for
example, the permutations π whose ... 05A05
Abstract
A class of permutations Π is called closed if π ⊂ σ ∈ Π implies π ∈ Π, where
the relation ⊂ is the natural containment of permutations. Let Π
n
be the...
Báo cáo toán học: " On a Partition Function of Richard Stanley" pptx
... dealing with partitions whose parts are all some
given N.Welet¯π be that partition made up of the parts of π that are <N. In light of
(11) we see that if N is a part of π an even number of ... questions.
2 The Main Theorem
We begin with some preliminaries about partitions and their conjugates. For a given
partition π with parts each N,wedenotebyf
i
(π) the number of...
Báo cáo toán học: "Avoiding rainbow induced subgraphs in vertex-colorings" pptx
... vertices spanning C
4
in G. Color all vertices of U
with color 1 and
rainbow color the remaining vertices with colors {2, . . . , k}. Under this coloring, there is
a rainbow copy of H containing exactly ... with distinct
colors, color the rest of the graph with the remaining colors. Let S induce a rainbow copy
of H in G in this coloring.
Suppose v ∈ S. Since k − 1 non-neighbors...
Báo cáo toán học: "On self-complementary cyclic packing of forests" pptx
... subgraph of a self-complementary graph H of order n with a cyclic
self-complementary permutation.
By Lemma 2, we obtain that if the star K
1,k
is a subgraph of a self-complementary
graph of order ... structure of self-complementary permutations. By Theorem
6, the expectation that a graph is a subgraph of a self-complementary graph H of the
same order rises with the n...
Báo cáo toán học: "On small dense sets in Galois planes" pptx
... saturating sets in small projective geome-
tries, European J. Combin. 21 (2000), 563–570.
[7] A.A. Davydov, S. Marcugini and F. Pambianco, On saturating sets in projective
spaces, J. Combin. Theory ... As well as being a natural geometrical
problem, the construction of small dense sets in P G(2, q) is relevant in other areas of
Combinatorics, as dense sets are related...
Báo cáo toán học: "On the First Eigenvalue of Bipartite Graphs" ppt
... n
2
2. Then for e 5 the theorem follows
from Theorem 5.4 for r = 2 and Theorem 4.1. For e = 3 the theorem is trivial. For r 3
the theorem follows f r om Proposition 5.3, Theorem 5.4 and Theorem ... absolute values of the eigenvalues. The ma-
trix B fr om (2.1) satisfies B
2
=
AA
⊤
0
0 A
⊤
A
, and so the eigenvalues of B
2
are those of AA
⊤
together with those of A...
Báo cáo toán học: "On a conjecture concerning the Petersen graph" ppt
... or
(iii) B has all attachments in N
′
2
∪N
′
3
∪N
′
4
, and each of N
′
2
, N
′
3
and N
′
4
contains at least
one such attachment.
Proof of Claim 6: If j = 4 and x
2
and x
j
are not adjacent, then ... such that at most two pair of them are
adjacent. Therefore, no non-edge-bridge can have attachments in more than two N
′
i
’s,
and if it has atta chments in two N
′
i
’s, say in N
′
i
and in .....
Báo cáo toán học: " On cubic planar hypohamiltonian and hypotraceable graph" pptx
... electronic journal of combinatorics 18 (2011), #P85 6
2 Cubic planar hypohamiltonian graphs on 70 and
88 vertices
In this section we present our cubic planar hypohamiltonian graphs on 70 and 88 ... 0-
and 1-faces together non-2-faces.
Claim 2.1. A cubic planar hypohamiltonian graph has at least three non-2-faces.
Proof. Let D be an arbitrary cubic planar hypo...
Báo cáo toán học: "On the path-avoidance vertex-coloring game" ppt
... mentioned, the upper bound follows immediately by
combining Theorem 5 with the upper bound on δ(c) stated in Theorem 7, using the
non-negativity of the o(1) term in Theorem 5. The proof of the lower ... P
8
in
color 2. The precise strategy definition is given below in the proof of Proposition 12.
The recursion defined in the following evaluates the performance of the str...