Caps and Wickets
Jakob F\"uhrer, Jozsef Solymosi

TL;DR
This paper establishes a new lower bound on the Turán number for wickets, a specific hypergraph structure, by leveraging cap set estimates and explores its connections to additive combinatorics.
Contribution
It introduces a novel lower bound for the Turán number of wickets and links this problem to key questions in additive combinatorics.
Findings
New lower bound on Turán number for wickets
Connection between hypergraph problems and additive combinatorics
Use of cap set estimates in hypergraph extremal problems
Abstract
Let be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, {\em wicket}, is formed by three rows and two columns of a point matrix. In this note, we give a new lower bound on the Tur\'an number of wickets using estimates on cap sets. We also show that this problem is closely connected to important questions in additive combinatorics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Tensor decomposition and applications · graph theory and CDMA systems
