An Improvement of the Asymptotical Upper Bound for the Cardinality of Sidon Sets of Vectors with Binary Components
ISEF · 2018 Mathematics
Overview
Let G=(Z_2)^k. That is, the set of k-dimensional vectors with binary components. We say that a subset of G (call this A) is a 'Sidon Set' if all pairwise sums, a_i+a_j (i<j) in A, are distinct (mod 2). The problem is to estimate the cardinality of A (typically denoted |A|) asymptotically. In this project, we improve the current best upper bound of |A| - provided in 1969 by the Swedish mathematician, Bernt Lindström
Competition history
- ISEF 2018
Resources
Related projects
ISEF · 2016
On the Coverings of {0,1,2 }^n with Minimal Cardinality
ISEF · 2018
Asymptotics of Character Sums
ISEF · 2020
On a Variation of the Witsenhausen Problem Concerning Maximal pi/2-Avoiding Spherical Sets
ISEF · 2018
The Analogue of Szemeredi's Theorem for Rectangles, n x n Lattice, Cuboid and n-Orthotope
Closest projects by meaning, across every fair and year in the corpus.
Source: Regeneron International Science and Engineering Fair