Related papers: Exceptional set estimate through Brascamp-Lieb ine…

For $A\subseteq \mathbb{R}$, let $A+A=\{a+b: a,b\in A\}$ and $AA=\{ab: a,b\in A\}$. For $k\in \mathbb{N}$, let $SP(k)$ denote the minimum value of $\max\{|A+A|, |AA|\}$ over all $A\subseteq \mathbb{N}$ with $|A|=k$. Here we establish…

We study the query complexity of finding a Tarski fixed point over the $k$-dimensional grid $\{1,\ldots,n\}^k$. Improving on the previous best upper bound of $\smash{O(\log^{\lceil 2k/3\rceil} n)}$ [FPS20], we give a new algorithm with…

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets…

We prove that if $A\subseteq \{ 1,2,\dots, N \}$ does not contain any solution to the equation $x_1+\dots+x_k=y_1+\dots+y_k$ with distinct $x_1,\dots,x_k,y_1,\dots,y_k\in A$, then $|A|\ll {k^{3/2}}N^{1/k}.$

Statistical extreme value theory is concerned with the use of asymptotically motivated models to describe the extreme values of a process. A number of commonly used models are valid for observed data that exceed some high threshold.…

For integers $n \geq k \geq 1$, the {\em Kneser graph} $K(n, k)$ is the graph with vertex-set consisting of all the $k$-element subsets of $\{1,2,\ldots,n\}$, where two $k$-element sets are adjacent in $K(n,k)$ if they are disjoint. We show…

We fully resolve the Furstenberg set conjecture in $\mathbb{R}^2$, that a $(s, t)$-Furstenberg set has Hausdorff dimension $\ge \min(s+t, \frac{3s+t}{2}, s+1)$. As a result, we obtain an analogue of Elekes' bound for the discretized…

The Moser-Trudinger embedding has been generalized in [Adimurthi A.; Sandeep K., A singular Moser-Trudinger embedding and its applications, \textit{NoDEA Nonlinear Differential Equations Appl.}, 13 (2007), no. 5-6, 585--603] to the…

Value-based reinforcement-learning algorithms have shown strong results in games, robotics, and other real-world applications. Overestimation bias is a known threat to those algorithms and can sometimes lead to dramatic performance…

The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the intermediate sets remain independent. Extremal problems on…

We present a procedure to diagnose model misspecification in situations where inference is performed using approximate Bayesian computation. We demonstrate theoretically, and empirically that this procedure can consistently detect the…

We study the $\delta$-discretized sum-product estimates for well spaced sets. Our main result is: for a fixed $\alpha\in(1,\frac{3}{2}]$, we prove that for any $\sim|A|^{-1}$-separated set $A\subset[1,2]$ and $\delta=|A|^{-\alpha}$, we…

Let $S(t) = \frac{1}{\pi}\Im \log\zeta\left(\frac{1}{2}+it\right)$. We prove an unconditional lower bound on the measure of the sets $\{t\in [T,2T] \colon S(t) \geq V\}$ for $\sqrt{\log\log T} \leq V \ll \left(\frac{\log T}{\log \log…

An exchangeable pair approach is commonly taken in the normal and non-normal approximation using Stein's method. It has been successfully used to identify the limiting distribution and provide an error of approximation. However, when the…

Fix a subset $I\subseteq \mathbb R_{>0}$ such that $\gamma=\inf\{ \sum_{i}n_ib_i-1>0 \mid n_i\in \mathbb Z_{\geq 0}, b_i\in I \}>0$. We give a explicit upper bound $\ell(\gamma)\in O(1/\gamma^2)$ as $\gamma\to 0$, such that for any smooth…

Elimination of unknowns in systems of equations, starting with Gaussian elimination, is a problem of general interest. The problem of finding an a priori upper bound for the number of differentiations in elimination of unknowns in a system…

We apply the methods of algebraic reliability to the study of percolation on trees. To a complete $k$-ary tree $T_{k,n}$ of depth $n$ we assign a monomial ideal $I_{k,n}$ on $\sum_{i=1}^n k^i$ variables and $k^n$ minimal monomial…

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

For any fixed positive integer $k$, let $\alpha_{k}$ denote the smallest $\alpha \in (0,1)$ such that the random graph sequence $\left\{G\left(n, n^{-\alpha}\right)\right\}$ does not satisfy the zero-one law for the set $\mathcal{E}_{k}$ of…