Báo cáo toán học: "How many square occurrences must a binary sequence contain?" docx
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 occurrences ... 1)
×
m(k)
k
.
Note that a binary word can contain Θ(n
2
) square occurrences (consider the word 1
n
)
and as many as Θ(n log n) occurrences of prim...
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 khoa học: "How Many Words is a Picture Worth? Automatic Caption Generation for News Images" docx
... 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 Translation Edit Rate ... Semantic Analysis, Psy-
chology Press.
Vailaya, Aditya, M
´
ario A. T. Figueiredo, Anil K.
Jain, and Hong-Jiang Zhang. 2001. Image clas-
sification for content-based indexing. IEEE
Transac...
Báo cáo toán học: " How to find overfull subgraphs in graphs with large maximum degree, II" ppsx
... 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 chromatic index of graphs of even order
with many edges. J. Graph Theory ... 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 A...
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: "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 ... case one can assume that the pair (F, G) is maximal with
respect to the property that all F ∈F have at least one G ∈Gdisjoint from it (and the
same holds for any G ∈G)...
Báo cáo toán học: "How long can a graph be kept planar" pot
... 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
obtain a result that ... is a similarly natural setup. One such scenario is when a Maker/Breaker
game is played on a monotone decreasing family H, for example the family of planar
graphs. This is then...
Báo cáo toán học: "How to Draw Tropical Planes" doc
... labeled
b in T
a
and, symmetrically, a leaf labeled a in T
b
. See Example 4.7 below for more details,
including an argument why this abstract arrangement cannot be realized as a metric
arrangement.
1
3
2
3
1 ... tropical curves [23].
∗
This author was supported by a Graduate Grant of TU Darmstadt.
†
This author was supported by a So a Kovalevskaja prize awarded to Olga Holtz at...
Báo cáo toán học: "The many formulae for the number of Latin rectangles" doc
... feedback.
Thanks to Donald Keedwell for some historical remarks. Thanks also to Brendan McKay,
Richard Brualdi, Xiaoguang Liu, Gang Wang and Arthur Yang for assistance tracking
down references.
The author ... in L. In fact, the biadjacency matrix of B
′
is the template of L (see
Section 3). Recall that, for any graph, a one-factor is a 1-regular spanning subgraph and
a one-factorisation...
Báo cáo toán học: "How frequently is a system of 2-linear Boolean equations solvable" ppsx
... we became aware of a recent paper [10] by Daud´e and
Ravelomanana. They studied a close but different case, when a system of m equations
is chosen uniformly at random among all n(n − 1) equations ... bichromatic with exponentially
small probability. In [8] this exponential smallness was established for the conditional
probability, given that the random graph has a giant component.
Here...