𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Upper Bounds for Finite Bh Sequences

✍ Scribed by Javier Cilleruelo

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
258 KB
Volume
159
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

✦ Synopsis

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 have an independent interest for further research in additive number theory.

πŸ“œ SIMILAR VOLUMES

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; . . .

New Upper Bounds for Maximum Satisfiabil
New Upper Bounds for Maximum Satisfiability
✍ Rolf Niedermeier; Peter Rossmanith πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 168 KB

The unweighted Maximum Satisfiability problem MAXSAT is: Given a Boolean formula in conjunctive normal form, find a truth assignment that satisfies the largest number of clauses. This paper describes exact algorithms that provide new Ε½< < upper bounds for MAXSAT. We prove that MAXSAT can be solved i

New Upper Bounds for Ramsey Numbers
New Upper Bounds for Ramsey Numbers
✍ Y.R Huang; K.M Zhang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 79 KB

The Ramsey number R(G 1 , G 2 ) is the smallest integer p such that for any graph Some new upper bound formulas are obtained for R(G 1 , G 2 ) and R(m, n), and we derive some new upper bounds for Ramsey numbers here.

Binary B2-Sequences : A New Upper Bound
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.

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.