The small Kakeya sets in T2*(C), C a conic

DOI10.1002/jcd.21507zbMath1338.05033arXiv1601.03539OpenAlexW1882793205MaRDI QIDQ2812298

Maarten De Boeck

Publication date: 16 June 2016

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.03539

zbMATH Keywords

bipartite graphslinear representationKakeya setsedge-disjoint maximal cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Other finite linear geometries (51E26)

Cites Work

• An improved lower bound on the size of Kakeya sets over finite fields
• The minimal number of lines intersected by a set of \(q+2\) points, blocking sets, and intersecting circles
• The Kakeya problem: a gap in the spectrum and classification of the smallest examples
• On the size of Kakeya sets in finite fields
• Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The small Kakeya sets in T2*(C), C a conic