✦ LIBER ✦

An Upper Bound for B2[2] Sequences

✍ Scribed by Javier Cilleruelo

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 89 KB
Volume: 89
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1999.3012

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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 New Upper Bound for B2[2] Sets

✍ Alain Plagne 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 94 KB

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

Upper and Lower Bounds for Finite Bh[g]

Upper and Lower Bounds for Finite Bh[g] Sequences

✍ Javier Cilleruelo; Imre Z. Ruzsa; Carlos Trujillo 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 113 KB

We give a non-trivial upper bound for F h ðg; NÞ, the size of a B h ½g subset of f1; . . . ; Ng, when g > 1. In particular, we prove F 2 ðg; NÞ41:864ðgNÞ 1=2 þ 1, and F h ðg; NÞ4 1 ð1þcos h ðp=hÞÞ 1=h ðhh!gNÞ 1=h , h > 2. On the other hand, we exhibit B 2 ½g subsets of f1; . . .

An upper bound for some ramsey numbers

✍ Andrew Thomason 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra

An Upper Bound Theorem for Rational Poly

An Upper Bound Theorem for Rational Polytopes

✍ Margaret M Bayer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 190 KB

The upper bound inequality h i (P)&h i&1 (P) ( n&d+i&2 i ) (0 i dÂ2) is proved for the toric h-vector of a rational convex d-dimensional polytope with n vertices. This gives nonlinear inequalities on flag vectors of rational polytopes. ## 1998 Academic Press A major result in polytope theory is th