Báo cáo toán hoc:" An Edge-Minimization Problem for Regular Polygons " pps
Báo cáo toán học: " An Embedding Algorithm for Supercodes and Sucypercodes Kieu Van Hung and Nguyen Quy Khang Hanoi Pedagogical " doc
... Shyr, and G. Thierrin, Outfix and infix co des and related
classes o f languages, J. Computer and System Sciences 43 (1991) 484–508.
5. H. J¨urgensen and S. Konstatinidis, Codes, G. Rozenberg and ... for
their useful discussions and attention to the work. Especially, the authors are indebted
to Profs. Do Long Van and Phan Trung Huy for their kind help.
References
1. J. Berstel and D. Perrin...
Báo cáo toán học: "An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions" docx
... t ∈ [0, 2π]) and using the symmetry of the integrand.
For an integer n ≥ 2 and real numbers a, b and x,let
I(n, x, a, b):=
b
a
n
=2
sin t
sin t
cos
xtn
3/2
3
dt
and
I(n, x):=I
n, ... ···
Acknowledgement. I wish to thank the referee for numerous comments and
suggestions which have led to a substantially improved paper.
An Asymptotic Expansion for the Number of
Permu...
Báo cáo toán học: "An asymptotic Result for the Path Partition Conjecture" pps
... N
P
(H
2
) ,and w
+
∈ N
P
(H
1
) . By Lemma 3.1(b) the first case cannot occur,
since we cannot have {u, w}⊆N
P
(H
1
)and{u
+
,w
+
}⊆N
P
(H
2
) . Also, the second
case cannot occur, since we cannot ... partition of the vertex set of G into two sets, A and B, such that τ (A) ≤ a
and τ (B) ≤ b is called an (a, b)-partition of G.IfG has an (a, b)-partition for
every pair (a, b) of posit...
Báo cáo toán học: "An Infinite Antichain of Permutations" ppsx
... first paragraph, P is
defined over an infinite alphabet and the “size” of its elements can be arbitrarily large. On
the other hand, if there is an infinite antichain, and we will find one, then it shows ... saying that p
1
<p
2
if and only if p
1
is a pattern of
p
2
. For example, 1 3 2 < 24531aswecandelete 4and 1 fromthelatter toget 253,which
becomes 1 3 2 after re-naming. Another way...
Báo cáo toán học: "New lower bounds for Heilbronn numbers" pps
... Comellas and J.L.A. Yebra, An optimization problem, manuscript.
[6] A.W.M. Dress, Yang Lu, and Zeng Zhenbing, Heilbronn problem for six points in
a planar convex body. Combinatorics and Graph ... Heilbronn problem include an algorithm, provided in 1997
by C. Bertram-Kretzberg, T. Hofmeister, and H. Lefmann [3], which for a discretization of
the problem finds a triangle with area...
Báo cáo toán học: " he Local Theorem for Monotypic Tilings" ppsx
... the
program organizers: Michael Baake, Uwe Grimm, Robert V. Moody, Alexander Quandt,
and Janusz Wolny.
We also thank two anonymous referees for their helpful comments.
References
[1] A.D.Alexandrov, ... − 1, the analogous theorem fails.
We can already see in the plane why the analogous statement with l = d − 1isnot
true. If T is a plane tiling by triangles such that at least four triangles...
Báo cáo toán học: "An Extremal Characterization of Projective Planes" pps
... vertices (for
information on generalized polygons, see Van Maldeghem [19] or Brouwer, Cohen and
Neumaier [4]). In the case k = 3, when the geometry is better known as a projective
plane of order ... and Gy¨ori,
Pach and Simonovits [13], Fiorini and Lazebnik [7, 8]). The Tur an problem is the most
familiar instance of this problem, where H = K
2
, and is discussed in detail in Bollob´as...
Báo cáo toán học: "On a problem of Marco Buratti" pps
... case another Hamiltonian path. Any such
replacement will be called an α-transformation. Notice that for i = 0 or i = 2n − 1
the three possibilities reduce to a single one, thus applying α-transformations ... d
a
∈ L. For d even, if a ≥ d and a even, then d
a
∈ L
2
; for
a ≥ d, a odd, we put d
a−1
∈ L
2
and d
1
∈ L
4
; for a < d and a odd, d
a
∈ L
1
, for a < d, a
even, we pu...
Báo cáo toán học: "An extremal theorem in the hypercube" pps
... C
10
. Therefore, unlike C
4
and C
6
, a counterex-
ample to the conjecture that ex(Q
n
, C
10
) = o(e(Q
n
)) cannot come from a colouring. On
the o ther hand, Alon et al. [2] and Axenovich and Martin ... 2
n
vertices and, being
n -regular, 2
n−1
n edges. Erd˝os [11] was the first to draw attention to Tur an- type problems
in the cube when he asked how many edges a C
4
-free subgraph of the cu...
Từ khóa: