Variants of the Kakeya problem over an algebraically closed field

Abstract

First, we study constructible subsets of nk which contain a line in any direction. We classify the smallest such subsets in 3 of the type R\g≠ 0\, where g∈ k[x1,...,xn] is irreducible of degree d, and R⊂ V(g) is closed. Next, we study subvarieties X⊂N for which the set of directions of lines contined in X has the maximal possible dimension. These are variants of the Kakeya problem in an algebraic geometry context.

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…