Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
minimal size of sets containing a line in every direction
|
| gptkbp:dimensions |
n-dimensional finite vector space
|
| gptkbp:field |
gptkb:mathematics
|
| gptkbp:hasApplication |
theoretical computer science
incidence geometry additive combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
finite field Kakeya problem
|
| gptkbp:inspiredBy |
Euclidean Kakeya problem
|
| gptkbp:notableAchievement |
lower bound on size of Kakeya sets in finite fields
Dvir's theorem finite field Kakeya conjecture proved |
| gptkbp:proposedBy |
Zeev Dvir
|
| gptkbp:relatedTo |
gptkb:Kakeya_set
combinatorics finite field incidence geometry |
| gptkbp:solvedBy |
polynomial method
Zeev Dvir |
| gptkbp:solvedInYear |
2008
|
| gptkbp:type |
What is the minimal size of a subset of F_q^n containing a line in every direction?
|
| gptkbp:bfsParent |
gptkb:Kakeya_set
|
| gptkbp:bfsLayer |
7
|