Related papers: Query complexity and the polynomial Freiman-Ruzsa …

We prove new exponents for the energy version of the Erd\H{o}s-Szemer\'edi sum-product conjecture, raised by Balog and Wooley. They match the previously established milestone values for the standard formulation of the question, both for…

We prove the strong form of the Gaussian product conjecture in dimension three. Our purely analytical proof simplifies previously known proofs based on combinatorial methods or computer-assisted methods, and allows us to solve the case of…

Using results relating the complexity of a two dimensional subshift to its periodicity, we obtain an application to the well-known conjecture of Furstenberg on a Borel probability measure on $[0,1)$ which is invariant under both $x\mapsto…

Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…

A weaker form of the multiplicity conjecture of Herzog, Huneke, and Srinivasan is proven for two classes of monomial ideals: quadratic monomial ideals and squarefree monomial ideals with sufficiently many variables relative to the Krull…

We display an application of the notions of kernelization and data reduction from parameterized complexity to proof complexity: Specifically, we show that the existence of data reduction rules for a parameterized problem having (a). a…

The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…

Given $d,s \in \mathbb{N}$, a finite set $A \subseteq \mathbb{Z}$ and polynomials $\varphi_1, \dots, \varphi_{s} \in \mathbb{Z}[x]$ such that $1 \leq deg \varphi_i \leq d$ for every $1 \leq i \leq s$, we prove that \[ |A^{(s)}| +…

We prove that, for every rational $d\ne 0,\pm 1$ and every compact set $K\subset\{s\in\mathbb{C}:1/2<\Re(s)<1\}$ with connected complement, any analytic non-vanishing functions $f_1,f_2$ on $K$ can be approximated, uniformly on $K$, by the…

We prove a query complexity lower bound for $\mathsf{QMA}$ protocols that solve approximate counting: estimating the size of a set given a membership oracle. This gives rise to an oracle $A$ such that $\mathsf{SBP}^A \not\subset…

We prove Bogolyubov-Ruzsa-type results for finite subsets of groups with small tripling, $|A^3|\leq O(|A|)$, or small alternation, $|AA^{\text{-}1} A|\leq O(|A|)$. As applications, we obtain a qualitative analog of Bogolyubov's Lemma for…

We study (tame) frieze patterns over subsets of the complex numbers, with particular emphasis on the corresponding quiddity cycles. We provide new general transformations for quiddity cycles of frieze patterns. As one application, we…

We show two results. First, a refinement of Freiman's theorem: if A is a finite set of integers and |A+A| < K|A|, then A is contained in a multidimensional progression of dimension at most O(K^{7/4} log^3K) and size at most exp(O(K^{7/4}…

In contrast with the notion of complexity, a set $A$ is called anti-complex if the Kolmogorov complexity of the initial segments of $A$ chosen by a recursive function is always bounded by the identity function. We show that, as for…

In 1971, Ruzsa conjectured that if $f:\ \mathbb{N}\rightarrow\mathbb{Z}$ with $f(n+k)\equiv f(n)$ mod $k$ for every $n,k\in\mathbb{N}$ and $f(n)=O(\theta^n)$ with $\theta<e$ then $f$ is a polynomial. In this paper, we investigate the…

We investigate the proof complexity of a class of propositional formulas expressing a combinatorial principle known as the Kneser-Lov\'{a}sz Theorem. This is a family of propositional tautologies, indexed by an nonnegative integer parameter…

We disprove the sum-product conjecture for real numbers by constructing arbitrarily large $A\subset \mathbb{R}$ (whose elements are algebraic integers in a number field of degree $\asymp \log\lvert A\rvert$) such that \[\max(\lvert…

This paper studies weakly mixing (singular) and mixing masas in type $\rm{II}_{1}$ factors from a bimodule point of view. Several necessary and sufficient conditions to characterize the normalizing algebra of a masa are presented. We also…

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof…

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…