English

Sidon sets and 2-caps in $\mathbb{F}_3^n$

Combinatorics 2020-10-14 v2

Abstract

For each natural number dd, we introduce the concept of a dd-cap in F3n\mathbb{F}_3^n. A subset of F3n\mathbb{F}_3^n is called a dd-cap if, for each k=1,2,,dk = 1, 2, \dots, d, no k+2k+2 of the points lie on a kk-dimensional flat. This generalizes the notion of a cap in F3n\mathbb{F}_3^n. We prove that the 22-caps in F3n\mathbb{F}_3^n are exactly the Sidon sets in F3n\mathbb{F}_3^n and study the problem of determining the size of the largest 22-cap in F3n\mathbb{F}_3^n.

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

R2 v1 2026-06-23T04:05:51.510Z