9 citations · 11 across the 7 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.CA2025
Polynomial bounds for the Chowla Cosine Problem
Benjamin Bedert
Let be a finite set of positive integers, and consider the cosine sum . We prove that $$\min_x f_A(x)\leqslant -n^{ 1/5-o…
cs.DS2025
Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa +1
We introduce a new notion of sparsification, called \emph{strong sparsification}, in which constraints are not removed but variables can be merged. As our main result, we present a…
math.NT2025
Large sum-free subsets of sets of integers via -estimates for trigonometric series
Benjamin Bedert
A set is said to be \emph{sum-free} if there are no with . We show that there exists a constant such that any set of integers contains a sum-f…