Báo cáo toán học: " ON THE NUMBER OF FULLY PACKED LOOP CONFIGURATIONS WITH A FIXED" pot
Báo cáo toán học: " ON THE NUMBER OF FULLY PACKED LOOP CONFIGURATIONS WITH A FIXED" pot
... we are not in one of these cases, then there is exactly one edge e attached to v which is
below l.Theedgee is on a loop of the configuration. Let us start with e and follow the
part of the loop ... which is based on a variation of the above reasoning, see
Section 5. Finally, for the proof of the more specific assertions in Conjectures 1.1 and 1.2
on the i...
Báo cáo toán học: "On the Counting of Fully Packed Loop Configurations: Some new conjectures" ppt
... configurations of FPL with periodic boundary conditions.
At this stage all these expressions remain empirical, and based on the actual data of
the linear problem. The connection with the numbers of FPL ... is a
local peak of the path, or has one less box than Y if i is a local minimum of the path
(and then Y ∈ F(
¯
Y )), or is a diagram with a larger numb...
Báo cáo toán học: " ON THE NUMBER OF DESCENDANTS AND ASCENDANTS IN RANDOM SEARCH TREES" ppsx
... 1996.
[29] B. Salvy and P. Zimmermann. Gfun: a Maple package for the manipulation of generating and holonomic functions
in one variable. ACM Transactions on Mathematical Software, 20(2):163–177, ... solve the differential equations
that we had.
The last step, that of extracting coefficients in exact form, was, at large, the least systematic
and mechanical one. A great deal of...
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 ... estimate the number of Hamilton cycles of G to
within arbitrary accuracy. Formally, there is a Fully Polynomial Time Randomised Ap-
proximation Scheme fo...
Báo cáo toán học: "On the number of permutations admitting an m-th root" pptx
... applied a theorem of Hardy, Littlewood and Karamata
to the exponential generating function of these permutations to obtain an asymptotic
equivalent of the partial sums of the required numbers ... singularities. The lemma shows that the singularity of C
m
at 1 determines
alone the asymptotics of c
n
(m) via transfer theorem *. The constant κ
m
× Γ
ϕ(m)
m
is
the...
Báo cáo toán học: "On the number of possible row and column sums of 0,1-matrices" pps
... R. Snow, and N. Wallach. A combinatorial problem associated with nono-
grams, Linear Algebra and its Applications, Volume 412, Issue 1, 1 January 2006,
Pages 30–38.
[2] R. H. Brualdi and H. J. ... a
j
be the number of rows of R that have exactly j ones. Write a = (a
0
, ,a
n
)=
a( x)inN
n+1
.Wenotethat |a| = m,andwrite
m
a
for the multinomial coefficient
m!
a
0
!··...
Báo cáo toán học: "On the number of orthogonal systems in vector spaces over finite fields" ppsx
... combinatorial geometry deals with the question of whether
a sufficiently large subset of
d
,
d
or
d
q
contains a given geometric configuration. In
a recent paper [3], Iosevich and Senger showed that a ... zeros (with J
n
q,d
is the all one matrix and I
n
q,d
is the
identity matrix, both of size n
q,d
×n
q,d
). Therefore, the largest eigenvalue of V is D
q,d
and
the a...
Báo cáo toán học: "On the number of genus one labeled circle trees" doc
... collapsing
an e-graph to an edge (a specified one) the obtained u-c-tree has the same genus as the one
we began with.
Once the concept of e-graph is grasped, the way operations 1) and 2) act on a ... Edges e
1
and e
2
of a c-graph cross if they have a point in common on the drawing
of the c-graph other than their endpoints. Edges e
1
and e
2
of a c-graph G...
Báo cáo toán học: "On the Number of Planar Orientations with Prescribed Degrees" pptx
... that all faces have cardinality four. A 2-orientation of a
quadrangulation Q is an orientation of the edges such that all vertices but two non-adjacent 2-
orienta-
tion of a
quadran-
gulation
ones ... al. [16] present a theory of 2-orientations of plane quadrangulations, which
shows many similarities with the theories of Schnyder woods for triangulations. A quad-
r...
Báo cáo toán học: "On the Number of Matchings in Regular Graphs" pptx
... random variable with expectation
(r−1)
4
4
.
This means that the expected number of 4-edge matchings in a random graph is only a
fixed constant larger than the minimum possible, and also only a ... appear in
Journal of Statistical Physics.
[5] S. Friedland and U.N. Peled, Theory of Computation of Multidimensional Entropy
with an Application to the Monomer-Dimer Proble...
Từ khóa: