Benjamin Bedert

collaborators

4 papers

cs.DS2026

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.CA2025

Polynomial bounds for the Chowla Cosine Problem

Benjamin Bedert

Let $A \subset N$ be a finite set of $n = ∣ A ∣$ positive integers, and consider the cosine sum $f_{A} (x) = \sum_{a \in A} cos a x$ . We prove that $$\min_x f_A(x)\leqslant -n^{ 1/5-o…

math.NT2025

Large sum-free subsets of sets of integers via $L^{1}$ -estimates for trigonometric series

Benjamin Bedert

A set $B$ is said to be \emph{sum-free} if there are no $x, y, z \in B$ with $x + y = z$ . We show that there exists a constant $c > 0$ such that any set $A$ of $n$ integers contains a sum-f…

math.CA2025

An improved lower bound for a problem of Littlewood on the zeros of cosine polynomials

Benjamin Bedert

Let $Z (N)$ denote the minimum number of zeros in $[0, 2 I ¨ ]$ that a cosine polynomial of the form $f_{A} (t) = n \in A \sum cos n t$ can have when $A$ is a finite set of non-negative in…

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa

Polynomial bounds for the Chowla Cosine Problem

Large sum-free subsets of sets of integers via L1-estimates for trigonometric series

An improved lower bound for a problem of Littlewood on the zeros of cosine polynomials

Large sum-free subsets of sets of integers via $L^{1}$ -estimates for trigonometric series