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 searc
A Combinatorial Proof for the Football Pool Problem for Six Matches
✍ Scribed by Patric R.J. Östergård
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 171 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
✦ Synopsis
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 structure; this structure is used to give a combinatorial proof of the covering property of the set.
📜 SIMILAR VOLUMES
The Kostka numbers K \* + play an important role in symmetric function theory, representation theory, combinatorics and invariant theory. The q-Kostka polynomials K \* + (q) are the q-analogues of the Kostka numbers and generalize and extend the mathematical meaning of the Kostka numbers. Lascoux an
We give two combinatorial proofs of Franks' Theorem, that an area preserving torus homeomorphism with mean rotation zero has a fixed point. The first proof uses Lax's version of the Marriage Theorem. The second proof uses Euler's Theorem on circuits in graphs and an explicit method of Alpern for dec
## Academy of Sciences of the GDR \* The term MFC is used here for such products obtained by thermic treatment of pro,-,n hydrolysates in presence of carbohydrates and other additives. The term includes all preparations which are added to meat products, soups or snacks instead of meat.