Báo cáo toán học: "A generalization of some Huang–Johnson semifields" pot
Báo cáo toán học: "A generalization of some Huang–Johnson semifields" pot
... F
q
–linear set L(S) of P = P G(V, F
q
3
) o f rank 6 having a unique point P of
weight 2 (and hence a unique p l ane π of P of weight 5) and each other point of weight 1.
Moreover, if one of the following ... mifield S of F
3
is of type (i, j), then the transpose semifield S
t
of S is
of type (i, j) as well.
Proof. It follows from previous arguments and from Proposition 2.3...
Báo cáo toán học: "A Generalization of Gosper’s Algorithm to Bibasic" docx
... actually is a solution of the bibasic hypergeometric telescoping problem (1). This
completes the proof of the correctness of Algorithm Telescope
p,q
.
the electronic journal of combinatorics 3 (1996), ... of all
coefficient-denominators of
¯
P,letg denote the greatest common divisor of all coefficients of
l ·
¯
P , and define z := g/l. Then, for P
∗
:= z
−1
·
¯
P , the bibasic moni...
Báo cáo toán học: "A generalization of Simion-Schmidt’s bijection for restricted permutations" doc
... the number of diagram
squares of rank at least m − 2. In particular, π avoids all patterns of A
m
if and only if
every diagram square is of rank at most m − 3.
the electronic journal of combinatorics ... total number of returns in Dyck paths of
length 2n is equal to
3
2n+1
2n+1
n−1
. Each tunnel of length 2 and positive height is just the
connection line of a high peak.(...
Báo cáo toán học: "A generalization of generalized Paley graphs and new lower bounds for R(3, q)" pot
... choice of a special
element of highest order among the 7 different expressions of S
1
has the advantage of
enhancing the computing efficiency of the clique number of G
n
(A
i
).
3 The computation of ... set of representatives of all equivalence classes i n (A
i
, ≺). If d
i
(x) =
0 for every x ∈ M, then [A
i
] = 1.
the electronic journal of combinatorics 17 (2010), #N25 5
A...
Báo cáo toán học: "A generalization of Combinatorial Nullstellensatz" pot
... Applications
In this section we give an example of possible application of Theorem 2. In some sense it
generalizes the idea of lucky labelings of graphs from [2]. Given a simple graph G = (V, ... (u)
c(v) denote the sum of labels over the
the electronic journal of combinatorics 17 (2010), #N32 4
set N(u) of all neighbors of u in G. The function c is called a lucky labeling...
Tài liệu Báo cáo khoa học: "A GENERALIZATION OF THE OFFLINE PARSABLE GRAMMARS" doc
... f'mite set of symbols, so there is
only a finite number of strings of given length L,
and it has a finite number of rules, so there is only
a finite number of possible parse trees of given
depth ... the set of pairs [A,B] such that A
B by a tree of depth n. Clearly C t is the set of
pairs [A,B] such that (A ) B) is a rule of G. Also,
Cn+ 1
is the set of pair...
Báo cáo toán học: " Homoclinic solutions of some second-order nonperiodic discrete systems" pptx
... is just the repetition of the proof of Lemma
3.2, we omit the details of its proof.
With the aid of above preparations, now we will give the proof of Theorem 1.2.
Proof of Theorem 1.2 By(1.8), ... similar to the proof of Lemma 3.1, so we omit
the details of its proof.
Lemma 3.4 Under the conditions of Theorem 1.2, F(x) satisfies the PS condition.
Proof From the proof of Le...
Từ khóa: