Báo cáo toán học: "The Prime Power Conjecture is True for n pdf
Báo cáo toán học: "The Prime Power Conjecture is True for n pdf
... that abelian planar difference sets of
order n exist only for n a prime power. Evans and Mann [2] verified this for cyclic
difference sets for n ≤ 1600. In this paper we verify the PPC for n ≤ 2,000,000,
using ... group
for an exponent larger than v
∗
was greater than n + 1, it could be eliminated
immediately, and was not included in the table.
ThePrimePowerConjectureisTru...
Báo cáo toán học: "The Borodin-Kostochka conjecture for graphs containing a doubly critical edge" pptx
... c
y
extends D to an m − 1 coloring of G. This final contradiction completes the proof.
Acknowledgments
Thanks to the anonymous referee for pointing out that the original ∆ ≥ 9 condition in Theorem
A ... doubly-critical edge and satisfying
χ ≥ ∆ ≥ 6, then G contains a K
∆
.
1 Introduction
Way back in 1977, Borodin and Kostochka made the following conjecture (see [1]).
Conjecture. Every gra...
Báo cáo toán học: "The Fraction of Subspaces of GF(q)n with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson" pot
... Fix a prime power q, positive constants b ≤
1
2
and B<1−b,anda
function µ (n) =o(1). Then, uniformly for j, k, w satisfying
1 ≤ w ≤ µ (n) n
b
/ log
q
n and λ
def
≡
n
w
(q − 1)
w−1
q
k n
≤ B ... vectors is linearly dependent and
no proper subset is, then call the set minimally dependent. If w is the minimal
weight in V , the previous discussion shows that there is a bi...
Báo cáo toán học: "The Structure of Maximum Subsets of {1, . . . , n} with No Solutions to a + b = kc" potx
... kx − y is a 1-1 mapping from the interval [kx − n, n] to itself. For each y in
this interval, at most one of the numbers y and f(y) can lie in A,sinceA is k-sum-free.
To simplify notation, put ... a contradiction for sufficiently large n. Hence t must
equal three, for large enough n, as required.
Now we are nearly in a position to determine f (n, k). We want to calculate the car...
Báo cáo toán học: "The disjoint m-flower intersection problem for latin squares" pdf
... and N × N N. Let P ⊂ N
3
such that for any pair n
1
, n
2
∈ N , P contains
at most one triple of the form (n
1
, n
2
, n
3
), at most one triple of the form (n
1
, n
3
, n
2
) (P
is row latin), ... latin), and at most one triple of the form (n
3
, n
1
, n
2
) (P is column latin), for some
n
3
∈ N . Then the set P is a partial latin square. The number o...
Báo cáo toán học: "The t-pebbling number is eventually linear in t " pptx
... Introduction
Let G = (V, E) be an undirected graph. A pebbling distribution on G is a function
p: V → N
0
= {0, 1, 2, . . .}. A pebbling move consists of taking two pebbles off a vertex u
and adding one ... Sciences” and Grant-
in-Aid for Scientific Research from Ministry of Education, Science and Culture, Japan, and Japan Society
for the Promotion of Science.
the electronic journal of...
Báo cáo khoa học: The mitochondrial protein frataxin is essential for heme biosynthesis in plants potx
... participation of frataxin in delivering
iron to heme synthesis is frequently mentioned in the lit-
erature, scarce direct evidence exists on the role of this
protein in the biogenesis of heme-containing ... a potential donor to FC for insertion of
iron into the protoporphyrin ring during heme synthe-
sis. Knocking down the expression of frataxin in
human cells revealed significant defects...
Báo cáo toán học: "On Han’s Hook Length Formulas for Trees" pdf
... Y.C. Chen
1
Oliver X.Q. Gao
2
Peter L. Guo
3
Center for Combinatorics, LPMC-TJKLC
Nankai University, Tianjin 300071, P.R. China
1
chen@nankai.edu.cn,
2
oliver@cfc.nankai.edu.cn,
3
lguo@cfc.nankai.edu.cn
Submitted: ... functions. A probabilistic proof of
Yang’s formula has been found by Sagan [7]. By extending Han’s expansion technique to
k-ary trees, Chen, Gao and Guo [1] gave another proof...
Báo cáo toán học: "The 11-element case of Frankl’s conjecture" pptx
... Results
Throughout this paper F will denote a finite family of finite sets closed under unions and
X will denote the union of F. We will call F Frankl’s if X =
F contains an element
which is in at least one half ... other ones with |K| ≥ 5).
This means that |G| ≥ 6. Also, since no 5-set contains more than two 3-sets in F, we
get that any 6-set can contain at most four 3-sets in F. We now kn...
Báo cáo toán học: "The Loebl–Koml´s–S´s conjecture for trees of o o diameter 5 and for certain caterpillars" pptx
... Loebl–Koml´os–S´os conjecture is true for all trees of diameter at most 3. Barr
and Johansson [2], and independently Sun [11], proved the conjecture for all trees of
diameter 4. Our main result is a proof of Conjecture ... ends in y. The distance between
two vertices is the length of the shortest path connecting them. The diameter of G is the
longest distance between any t...