✦ LIBER ✦

A New Upper Bound for B2[2] Sets

✍ Scribed by Alain Plagne

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 94 KB
Volume: 93
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3084

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Binary B2-Sequences : A New Upper Bound

✍ Gérard Cohen; Simon Litsyn; Gilles Zémor 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 79 KB

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.

A Sharp Exponent Bound for McFarland Dif

A Sharp Exponent Bound for McFarland Difference Sets withp=2

✍ Siu Lun Ma; Bernhard Schmidt 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 291 KB

We show that under the self-conjugacy condition a McFarland difference set with p=2 and f 2 in an abelian group G can only exist, if the exponent of the Sylow 2-subgroup does not exceed 4. The method also works for odd p (where the exponent bound is p and is necessary and sufficient), so that we obt

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^_

New Upper Bound for the B-Spline Basis C

New Upper Bound for the B-Spline Basis Condition Number: II. A Proof of de Boor's 2k-Conjecture

✍ K Scherer; A.Yu Shadrin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 116 KB