Related papers: A quantitative improvement for Roth's theorem on a…

We consider integrals over vanishing cycles in the Milnor fibration of an isolated singularity defined by a Newton non-degenerate function. We single out a condition where the leading logarithmic term of the expansion of the integral into a…

Let Q(N;q,a) denotes the number of squares in the arithmetic progression qn+a, for n=0, 1,...,N-1, and let Q(N) be the maximum of Q(N;q,a) over all non-trivial arithmetic progressions qn + a. Rudin's conjecture asserts that Q(N)=O(Sqrt(N)),…

This is the text accompanying my Bourbaki seminar on the work of Bloom and Sisask, Croot, Lev, and Pach, and Ellenberg and Gijswijt.

Correctness proofs for floating point programs are difficult to verify. To simplify the task, a similar, but less complex system, known as logarithmic arithmetic can be used. The Boyer-Moore Theorem Prover, NQTHM, mechanically verified the…

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

The purpose of this note is to verify that the results attained in [6] admit an extension to the multidimensional setting. Namely, for subsets of the two dimensional torus we find the sharp growth rate of the step(s) of a generalized…

Let $\|n\|$ stand for the integer complexity of the number $n$, i.e. for the least number of $1$'s needed to write $n$ using arbitrary many additions, multiplications, and parentheses. The two-sided inequality $3\log_3 n\leq\|n\|\leq…

Permutations of the positive integers avoiding arithmetic progressions of length $5$ were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length $7$. We…

A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form $x$, $x+d$, $x+d^2$. We obtain a multidimensional version of this result, which can be regarded as a first step towards…

We consider the complexity for computing the approximate sum $a_1+a_2+...+a_n$ of a sorted list of numbers $a_1\le a_2\le ...\le a_n$. We show an algorithm that computes an $(1+\epsilon)$-approximation for the sum of a sorted list of…

Let $r_k(N)$ denote the size of the largest subset of $[N] = \{1,\ldots,N\}$ with no $k$-term arithmetic progression. We show that for $k\ge 5$, there exists $c_k>0$ such that \[r_k(N)\ll N\exp(-(\log\log N)^{c_k}).\] Our proof is a…

In this project we show the existence of arbitrary length arithmetic progressions in model sets and Meyer sets in the Euclidean $d$-space. We prove a van der Waerden type theorem for Meyer sets. We show that pure point subsets of Meyer sets…

It is established that for any finite set of positive real numbers $A$, we have $$|A/A+A| \gg \frac{|A|^{\frac{3}{2}+\frac{1}{26}}}{\log^{1/2}|A|}.$$

Suppose that $d \geq 2$, and that $A \subset [0,1]$ has sufficiently large dimension, $1 - \epsilon_d < \dim_H(A) < 1$. Then for any polynomial $P$ of degree $d$ with no constant term, there exists a point configuration $\{ x, x-t,x-P(t) \}…

In this paper, we prove that the discrete Copson inequality (E.T. Copson, \emph{Notes on a series of positive terms}, J. London Math. Soc., 2 (1927), 49-51) of one-dimension in general cases admits an improvement. In fact we study the…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…

We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density.

This paper presents the first non-asymptotic result showing that a model-free algorithm can achieve a logarithmic cumulative regret for episodic tabular reinforcement learning if there exists a strictly positive sub-optimality gap in the…

We establish functional limit theorems for ergodic sums of observables with power singularities for expanding circle maps. In the regime where the observables have infinite variance, we show that when rescaled by $N^{1/s}(\ln N)^\alpha$,…