𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Binary B2-Sequences : A New Upper Bound

✍ Scribed by Gérard Cohen; Simon Litsyn; Gilles Zémor

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
79 KB
Volume
94
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis

We show that the maximum size of a B 2 -sequence of binary n-vectors for large enough n is at most 2 0.5753n , thus improving on the previous bound 2 0.6n due to B. Lindstro m.

📜 SIMILAR VOLUMES

An Upper Bound for B2[2] Sequences
An Upper Bound for B2[2] Sequences
✍ Javier Cilleruelo 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 89 KB

We introduce a new counting method to deal with B 2 [2] sequences, getting a new upper bound for the size of these sequences, F(N, 2) -6N+1.

New Upper Bounds for Finite Bh Sequences
New Upper Bounds for Finite Bh Sequences
✍ Javier Cilleruelo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Let F h (N) be the maximum number of elements that can be selected from the set [1, ..., N] such that all the sums a 1 + } } } +a h , a 1 } } } a h are different. We introduce new combinatorial and analytic ideas to prove new upper bounds for F h (N). In particular we prove Besides, our techniques

A new upper bound for the harmonious chr
A new upper bound for the harmonious chromatic number
✍ Edwards, Keith 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 2 views

A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general

A new upper bound for the bipartite Rams
A new upper bound for the bipartite Ramsey problem
✍ David Conlon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ ≥ 2^_

A new upper bound on the cyclic chromati
A new upper bound on the cyclic chromatic number
✍ O. V. Borodin; H. J. Broersma; A. Glebov; J. van den Heuvel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

## Abstract A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number χ^__c__^. Let Δ^\*^ be the maximum face degree of a graph. There exist