𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Lower Bound for the Football Pool Problem for Six Matches

✍ Scribed by Patric R.J. Östergård; Alfred Wassermann

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
89 KB
Volume
99
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis

In the football pool problem one wants to minimize the cardinality of a ternary code, C F n 3 ; with covering radius one, and the size of a minimum code is denoted by s n : The smallest unsettled case is 634s 6 473: The lower bound is here improved to 65 in a coordinate-by-coordinate backtrack search using the LLL algorithm and complete equivalence checking of subcodes.

📜 SIMILAR VOLUMES

A Combinatorial Proof for the Football P
A Combinatorial Proof for the Football Pool Problem for Six Matches
✍ Patric R.J. Östergård 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Consider the set F 6 3 of all 6-tuples x 0 x 1 x 2 x 3 x 4 x 5 with x i # [0, 1, 2]. It is known that there is a subset C of F 6 3 with 73 elements such that, for any x # F 6 3 , there is a word in C that differs from x in at most one coordinate. We show that there exists such a set C with a clear s

A strong lower bound for the Node Weight
A strong lower bound for the Node Weighted Steiner Tree Problem
✍ Engevall, Stefan; G�the-Lundgren, Maud; V�rbrand, Peter 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is a generalization of the Steiner tree problem in the sense that vertex weights are considered. Given an undirected graph, the problem is to find a tree that spans a subset of the vertices and is such that the total

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 lower bound for the critical proba
A new lower bound for the critical probability of site percolation on the square lattice
✍ J. van den Berg; A. Ermakov 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far,