9 citations · 11 across the 7 of their papers we have counts for
7 papers
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…
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…
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…
An improved lower bound for a problem of Littlewood on the zeros of cosine polynomials
Benjamin Bedert
Let denote the minimum number of zeros in that a cosine polynomial of the form can have when is a finite set of non-negative int…
On the zeros of reciprocal Littlewood polynomials
Benjamin Bedert
Let be a Littlewood polynomial of degree , meaning that . We say that is reciprocal if . Borwein, Erdélyi and Litt…
On a distinguished family of random variables and Painlevé equations
Theodoros Assiotis, Benjamin Bedert, Mustafa Alper Gunes +1
A family of random variables , depending on a real parameter , appears in the asymptotics of the joint moments of characteristic polynomials of rando…
Moments of Generalized Cauchy Random Matrices and continuous-Hahn Polynomials
Theodoros Assiotis, Benjamin Bedert, Mustafa Alper Gunes +1
In this paper we prove that, after an appropriate rescaling, the sum of moments of an $…