Sidon sets and 2-caps in $\mathbb{F}_3^n$
Combinatorics
2020-10-14 v2
Abstract
For each natural number , we introduce the concept of a -cap in . A subset of is called a -cap if, for each , no of the points lie on a -dimensional flat. This generalizes the notion of a cap in . We prove that the -caps in are exactly the Sidon sets in and study the problem of determining the size of the largest -cap in .
Cite
@article{arxiv.1809.05117,
title = {Sidon sets and 2-caps in $\mathbb{F}_3^n$},
author = {Yixuan Huang and Michael Tait and Robert Won},
journal= {arXiv preprint arXiv:1809.05117},
year = {2020}
}
Comments
Revised version. Accepted to Involve