Applying hypersurface bounds to a conjecture by Carlet
Zo\"e Gemmell, Tim Trudgian

TL;DR
This paper advances understanding of Carlet's conjecture by applying hypersurface bounds to show that the inverse function is not $k$th order sum-free for a wider range of $k$ values, improving previous bounds.
Contribution
The paper introduces new bounds on hypersurface point counts to extend the known range where the inverse function is not $k$th order sum-free, advancing the proof of Carlet's conjecture.
Findings
Proves $f_{inv}$ is not $k$th order sum-free for $3 \\leq k \\leq rac{3}{13}n+0.461$
Improves previous bounds by Hou and Zhao
Utilizes hypersurface bounds by Cafure and Matera
Abstract
A function from to is th order sum-free if the sum of its values over each -dimensional -affine subspace is nonzero. It is conjectured that for odd and prime, is not th order sum-free for . This is the unresolved part of Carlet's conjecture, which gives exact values for which is th order sum-free. We give two results as improvements on an explicit estimate on the number of -rational points of an -definable hypersurface previously proved by Cafure and Matera. We use these results to prove that is not th order sum-free for , improving on work previously done by Hou and Zhao.
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
TopicsAlgebraic Geometry and Number Theory · Analytic Number Theory Research · Polynomial and algebraic computation
