Báo cáo toán học: "On the number of subsequences with a given sum in a finite abelian grou" pptx
Báo cáo toán học: "On the number of subsequences with a given sum in a finite abelian grou" pptx
... the number of subsequences with a given sum
in a finite abelian group
Gerard Jennhwa Chang,
123∗
Sheng-Hua Chen,
13†
Yongke Qu,
4‡
Guoqing Wang,
5§
and Haiyan Zha ng
6¶
1
Department of Mathematics, ... 1541–
1550.
[12] W.D. Gao, A. Geroldinger and Q.H. Wang, A quantitative aspect of non-unique
factorizations: the Narkiewicz constants, International Journal o...
Báo cáo toán học: "On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs" ppsx
... 6-cycle as in the
previous case.
Remark: The proof shows that the number of Hamilton cycles is within a poly-
nomial factor of the number of two factors of G. Therefore one can generate a (near)
random ... segment containing x, the segment containing x
, and the remaining segment.
Going round the cycle C
i
, starting at x
and ending at x, the vertices x,...
Báo cáo toán học: " ON THE NUMBER OF DESCENDANTS AND ASCENDANTS IN RANDOM SEARCH TREES" ppsx
... +1)
6
49n
6
.
7. The number of ascendants of a given node in a LBST
As in the case of the number of ascendants in a random BST, computing the probability that
the j
th
node in a random LBST has m ascendants ... pivot in each partitioning phase.
The study of the number of descendants has applications in the context of paged trees (see f...
Báo cáo toán học: "On the number of permutations admitting an m-th root" pptx
... =2
[Bl]. In the general case, Bender applied a theorem of Hardy, Littlewood and Karamata
to the exponential generating function of these permutations to obtain an asymptotic
equivalent of the partial ... only
cycles of length having a common factor with m (the adjective rectangular is chosen
because of the form of the Ferrers diagram associated to such a permu...
Báo cáo toán học: " ON THE NUMBER OF FULLY PACKED LOOP CONFIGURATIONS WITH A FIXED" pot
... of a certain region in the regular triangular
lattice. As in the preceding proof, we draw triangles around free vertices (where “free” has
the same meaning as in that proof) in such a way that ... that
case the determinant in (2.3) is equal to 1 because it is the determinant of a triangular
matrix with 1s on the antidiagonal. This completes the proof of...
Báo cáo toán học: "On the number of possible row and column sums of 0,1-matrices" pps
... m,andwrite
m
a
for the multinomial coefficient
m!
a
0
!·· a
n
!
With this notation, we have the following lemma.
Lemma 6 Let a in N
n+1
satisfy |a| = m. Then the number of x in N
m
such that ... sums of an m × n
matrix with entries in {0, 1} if and only if x
i
≤ n for all i.
Let a
j
be the number of rows of R that have exactly j ones. Write a = (a
0...
Báo cáo toán học: "On the number of orthogonal systems in vector spaces over finite fields" ppsx
... (2008), #N32 4
On the number of orthogonal systems
in vector spaces over finite fields
Le Anh Vinh
Mathematics Department
Harvard University
Cambridge, MA 02138, US
vinh@math.harvard.edu
Submitted: ... over a finite field is large enough, then it contains many k-tuples of mutually
orthogonal vectors. In this note, we provide a graph theoretic proof of this result.
1 Intr...
Báo cáo toán học: "On the number of genus one labeled circle trees" doc
... the drawing
of the c-graph other than their endpoints. Edges e
1
and e
2
of a c-graph G are parallel if
they cross the same edges of G, respectively. That the relation ‘parallel’ is an equivalence
relation ... edge, a representative of the set of parallel edges of the
e-graph in T . Since, according to Theorem 1, there can be at most two parallel e-graphs,
in T...
Báo cáo toán học: "On the Number of Planar Orientations with Prescribed Degrees" pptx
... be
computed in polynomial time with the aid of polynomially many calls to an oracle for the
number of Eulerian orientations of a planar graph.
In order to count the Eulerian orientations of a graph G with ... planar
map
of G in the Euclidean plane. In particular, M has a designated outer (unbounded) face.
We denote the sets of vertices, edges and face...
Báo cáo toán học: "On the Number of Matchings in Regular Graphs" pptx
... consisting of any number of
2
s and 1
s, and its subset of bipartite graphs, we characterize the optimal graphs
who maximize and minimize the number of m-matchings.
We find the expected value of ... m.
In the expression for φ(G, 4) the number of 4-cycles appeared as the first structure in
the graph, apart from n and r, which a ects the number of ma...