Báo cáo toán học: "A new class of q-Fibonacci polynomials" pot
Báo cáo toán học: "A new class of q-Fibonacci polynomials" pot
... illuminating combinatorial proof of (3.1 ), which is an adapta-
tion of Franklin’s proof of the pentagonal number theorem to this case (cf. [1] or [4]).
Let u beawordoflengthn − 1,u= a
n−1
. Then ... last letter
is b we need the following result of [6]:
the electronic journal of combinatorics 10 (2003), #R19 3
The above proof or the original proof of Franklin lets i
k
+ k invaria...
Báo cáo toán học: "A New Table of Constant Weight Codes of Length Greater than 28." docx
... The
column NewBest indicates a new best result. The meaning of the annotations is given in
the Key.
The tables show the relative merits of the general algorithms in terms of the number of
codewords ... forming a partition of the 28 points. The 63 blocks form 9 parallel classes.
Add a point 29 to each block of the first parallel class, 30 to each block of the
second, 37 to each...
Báo cáo toán học: "A New Family of Somos-like Recurrences" pptx
... has been
helpful in producing a combinatorial proof of integrality in some cases, many people pre-
fer proofs of Laurentness versus other proofs of integrality. In [3], Fomin and Zelevinsky
give ... journal of combinatorics 15 (2008), #R54 5
A New Family of Somos-like Recurrences
Paul Heideman
University of Wisconsin
Madison, WI 53705
ppheideman@wisc.edu
Emilie Hogan
Department...
Báo cáo toán học: " A NEW CONSTRUCTION FOR CANCELLATIVE FAMILIES OF SETS" doc
... define f(n) to be the size of the largest
possible cancellative family of subsets of a n-set and f(k,n) to be the size of the largest
possible cancellative family of k-subsets of a n-set.
Note the ... difference.
Let F
1
be a family of subsets of a n
1
-set, S
1
.LetF
2
be a family of subsets of a n
2
-
set, S
2
. WedefinetheproductF
1
× F
2
to be the family of subsets of...
Báo cáo toán học: "A new upper bound on the total domination number of a graph" pdf
... dominating set of G if every vertex of
G is adjacent to some vertex in S. The minimum cardinality of a total dominating
set of G is the total domination number of G. Let G be a connected graph of order ... journal of combinatorics 14 (2007), #R65 7
A new upper bound on the total
domination number of a graph
1
Michael A. Henning
∗
and
2
Anders Yeo
1
School of Mathematical S...
Báo cáo toán hoc:"A New Lower Bound on the Density of Vertex Identifying Codes for the Infinit" doc
... proof for Claim 1. However,
a short analysis of this proof yields a proof of Claim 2.
1 2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
C
Fig. 1: Proof of ... in
Proposition 1. The proof of Proposition 1 is instructive, because the proof is easy, yet the
proofs of Theorem 1 and Proposition 1 use the same core idea. We call the components
of...
Báo cáo toán học: "A new determinant expression of the zeta function for a hypergraph" ppt
... prime, reduced cycles of a graph G corresponds to a unique conjugacy class of the
fundamental group π
1
(G, v) of G at a vertex v of G.
The Ihara- Selberg zeta function of G is defined by
Z(G, ... [C] runs over all equivalence classes of prime, reduced cycles of G. Ihara [6] defined
zeta functions of graphs, and showed that the reciprocals of zeta functions of regular
grap...
Báo cáo toán học: "A new bound on the domination number of graphs with minimum degree two" docx
... bc(G; X) = 0 and
sc(G; X) = 0. We show next that no vertex of X is a cut-vertex of G.
Next we consider the set S of all vertices of G of degree 2 which do not belong to X;
that is, S = {x ∈ V ... para graph of the proof of Claim P1, we can show that γ(G
∗
; X
∗
) ≤ ψ(G
∗
; X
∗
),
as desired. ✷
Claim P3 Both v
1
and v
3
are adjacent in G
1
to at least one vertex not on C.
Proof....