Sidon sets and 2-caps in F3n

Abstract

For each natural number d, we introduce the concept of a d-cap in F3n. A subset of F3n is called a d-cap if, for each k = 1, 2, …, d, no k+2 of the points lie on a k-dimensional flat. This generalizes the notion of a cap in F3n. We prove that the 2-caps in F3n are exactly the Sidon sets in F3n and study the problem of determining the size of the largest 2-cap in F3n.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…