Báo cáo toán học: " How Many Squares Must a Binary Sequence Contain" pptx
Báo cáo toán học: " How Many Squares Must a Binary Sequence Contain" pptx
... q.
a
1
a
2
a
1
a
2
a
1
a
2
a
3
a
1
a
2
a
4
a
3
a
1
a
1
a
2
a
4
a
2
a
1
a
3
a
3
a
1
a
3
a
5
a
2
a
1
a
1
a
3
a
5
a
2
a
4
a
3
a
3
a
5
a
2
a
5
a
2
a
4
(3) Define C(q)by
C (a
1
) = 011 000 111 001
C (a
2
) ... of Mathematics, Curtin University, Perth WA 6001, Australia. Email:
tsimpsonr@cc.curtin.edu.au
Table 1. Possible pair...
Báo cáo toán học: "How many square occurrences must a binary sequence contain?" docx
... ternary
alphabet {a
1
,a
2
,a
3
} toawordW
5
over the quinary alphabet {a
1
,a
2
,a
3
,a
4
,a
5
},andthen
by applying to W
5
a morphism to the binary alphabet {0, 1}. The first step is such that
the ... 2003
Abstract
Every binary word with at least four letters contains a square. A. Fraenkel
and J. Simpson showed that three distinct squares are necessary and sufficient t...
Báo cáo khoa học: "How Many Words is a Picture Worth? Automatic Caption Generation for News Images" docx
... database contains a document an image, and its caption.
ples like the ones shown in Table 1. During test-
ing, we are given a document and an associated
image for which we must generate a caption.
Our ... divergence
similarity function).
Evaluation We evaluated the performance of
our models automatically, and also by eliciting hu-
man judgments. Our automatic evaluation was
based on T...
Báo cáo toán học: "Packing Unit Squares in a Rectangle" potx
... 1byLemma1andthetotal
score of U is ab− (a+ 1− a )−(b+1−b). Then we have N
<ab− (a+ 1− a )−(b+1−b)
for any factor λ
−1
< 1, i.e., ν (a, b) <ab− (a +1− a ) −(b +1−b), as required.
A square ... from the fact that each unit square consumes at least area 1
from the entire square R,whereR can be regarded as an unavoidable set from which unit
square takes score 1.
In the xy-plane...
Báo cáo toán học: "the complexity of obtaining a distance-balanced graph" pptx
... that have a minimal sum of distances
to all other vertices. They are also useful in mathematical chemistry. For example,
bipartite distance-balanced graphs have the maximal Szeged index among all ... term distance-balanced but in fact use
the equivalent definition of self-median.
Distance-balanced graphs are relevant in the area of facility location problems [4]
because the median of a gra...
Báo cáo toán học: " How to find overfull subgraphs in graphs with large maximum degree, II" ppsx
... electronic journal of combinatorics 8 (2001), #R7 11
How to find overfull subgraphs in graphs
with large maximum degree, II
Thomas Niessen
Institute of Statistics, RWTH Aachen,
52056 Aachen, Germany
niessen@stochastik.rwth-aachen.de
Submitted: ... referee.
References
[1] R.K. Ahuja, T.L. Magnanti and J.B. Orlin. Network flows. Prentice Hall (1993).
[2] A. G. Chetwynd and A. J.W. Hilton. The...
Báo cáo toán học: "How Berger, Felzenbaum and Fraenkel Revolutionized" doc
... only a
mathematical genius, but also a very talented pianist and erudite talmid khacham.
He was also very versatile in his mathematical interests, and did both pure ‘Radical
Calculus’, that he ... in collaboration with Alan Sloan, and very applied math,
consulting for industry. He was also “Black-Scholes when Black-Scholes wasn’t yet cool”,
and gave a fascinating series of talks about u...
Báo cáo toán học: "Atomic Latin Squares based on Cyclotomic Orthomorphisms" pdf
... New families of atomic Latin squares
and perfect one-factorisations, J. Combin. Theory Ser. A, toappear.
[4] J. D´enes and A. D. Keedwell, Latin squares and their applications,Akad´emiai Kiad´o,
Budapest, ... cyclic order down each
broken diagonal, and such squares have been called diagonally cyclic. See [18] for a survey
of the many important applications of diagonally cyclic lat...
Báo cáo toán học: "How different can two intersecting families be" ppsx
... F
outside I, as well. Note that A is not empty, since
F
1
,F
2
A. Now for any A ∈Alet f (A) = (A \ I) ∪{1}. (Observe that for any A A
there is A
A F
0
with A ∩ A
= I, A \ I = A \ A
,sof (A) ∈ 1 ... (A) ∈ 1 +∆F
0
as required!)
As all A ∈Acontain I, f is injective restricted to A.
To show that ρ
F
(f (A) ) ≥ ρ
F
(A) , observe that f (A) ⊂ A ∪{1}. Therefore...
Báo cáo toán học: "How long can a graph be kept planar" pot
... Published: May 5, 2008
Mathematics Subject Classification: 9 1A2 4
Abstract
The graph (non-)planarity game is played on the complete graph K
n
between
an Enforcer and an Avoider, each of whom take one ... rounds.
Hefetz al. [7] gave a strategy for Avoider that allowed him to keep his graph planar
for at least 3n −28
√
n turns. In this paper we provide a better strategy for Avoider and
obta...