Algebraic capsets
Cassie Grace, Jos\'e Felipe Voloch

TL;DR
This paper introduces new algebraic constructions of capsets in finite fields, achieving the smallest known complete capsets with sizes close to theoretical lower bounds.
Contribution
It presents novel algebraic methods to construct minimal complete capsets in _3^n, improving upon previous size bounds.
Findings
Constructed the smallest known complete capsets.
Achieved sizes proportional to the best known lower bounds.
Demonstrated algebraic equations over field extensions are effective for capset construction.
Abstract
Capsets are subsets of with no three points on a line and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of . In particular we construct the smallest known complete capsets with size proportional to the best known lower bound.
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 · Advanced Graph Theory Research · Computational Geometry and Mesh Generation
