Back to Search
Start Over
Caps and Wickets
- Publication Year :
- 2024
-
Abstract
- Let $H_n^{(3)}$ 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 $3 \times 3$ 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.<br />Comment: An updated version, correcting a gap in the previous version
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2405.00923
- Document Type :
- Working Paper