Related papers: On Suprema of Autoconvolutions with an Application…
We discuss three convolution inequalities that are connected to additive combinatorics. Cloninger and the second author showed that for nonnegative $f \in L^1(-1/4, 1/4)$, $$ \max_{-1/2 \leq t \leq 1/2} \int_{\mathbb{R}}{f(t-x) f(x) dx}…
We adapt a number-theoretic technique of Yu to prove a purely analytic theorem: if f(x) is in L^1 and L^2, is nonnegative, and is supported on an interval of length I, then the supremum of the convolution f*f is at least 0.631 \| f \|_1^2 /…
Using rigorous high-precision floating point arithmetic we compute very tight rigorous bounds on the auto-convolution constant \[ \nu_2^2 = \inf_f \|f \ast f\|_2^2 = \inf_f \int_{-1}^1 (f \ast f)^2 \] where the infimum is taken over all…
Let $\mathcal{F}$ denote the set of functions $f \colon [-1/2,1/2] \to \mathbb{R}$ such that $\int f = 1$. We determine the value of $\inf_{f \in \mathcal{F}} \| f \ast f \|_2$ up to a 0.0014\% error, thereby making progress on a problem…
Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…
This paper introduces a new problem concerning additive properties of convex sets. Let $S= \{s_1 < \dots <s_n \}$ be a set of real numbers and let $D_i(S)= \{s_x-s_y: 1 \leq x-y \leq i\}$. We expect that $D_i(S)$ is large, with respect to…
Representative examples of our results are as follows. For any positive integer $N$ the equation $$ x^3+y^3=z^3+t^3, \quad x,y,z,t\in \mathbb{N}, \quad \{x,y\}\not=\{z,t\} $$ has no solutions satisfying $$ N\le x,y,z,t <…
Given a compact convex domain $C\subset \mathbb{R}^k$ and bounded measurable functions $f_1,\ldots,f_n:C\to \mathbb{R}$, define the sup-convolution $(f_1\ast \ldots \ast f_n)(z)$ to be the supremum average value of…
The well-known $|supp(f)||supp(\widehat{f}|\geq |G|$ inequality gives lower estimation of each supports. In the present paper we give upper estimation under arithmetic constrains. The main notion will be the additive energy which plays a…
We find the optimal constant $C$ such that \begin{equation*} \|f_1*f_2*\dots*f_{k}\|_{\infty}\geq C\prod_{i=1}^{k}\|f_i\|_1 \end{equation*} for functions $f_i:\{0,1\}^d\to\mathbb{R}$. As applications, we derive bounds for Sidon sets on…
The theory of mixed finite element methods for solving different types of elliptic partial differential equations in saddle point formulation is well established since many decades. This topic was mostly studied for variational formulations…
We study a mixed-integer set $S:=\{(x,t) \in \{0,1\}^n \times \mathbb{R}: f(x) \ge t\}$ arising in the submodular maximization problem, where $f$ is a submodular function defined over $\{0,1\}^n$. We use intersection cuts to tighten a…
We consider the inequality $f \geqslant f\star f$ for real integrable functions on $d$ dimensional Euclidean space where $f\star f$ denotes the convolution of $f$ with itself. We show that all such functions $f$ are non-negative, which is…
We study the convolution function $$ C[f(x)] := \int_1^x f(y)f({x\over y}) {{\rm d} y\over y} $$ when $f(x)$ is a suitable number-theoretic error term. Asymptotics and upper bounds for $C[f(x)]$ are derived from mean square bounds for…
We give a slight improvement of the best known lower bound for the supremum of autoconvolutions of nonnegative functions supported in a compact interval. Also, by means of explicit examples we disprove a long standing natural conjecture of…
In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…
A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…
We propose an alternating subgradient method with non-constant step sizes for solving convex-concave saddle-point problems associated with general convex-concave functions. We assume that the sequence of our step sizes is not summable but…
In 2010, Cilleruelo, Ruzsa, and Vinuesa established a surprising connection between the maximum possible size of a generalized Sidon set in the first $N$ natural numbers and the optimal constant in an ``analogous'' problem concerning…
The objective of this paper is to obtain asymptotic results for shifted sums of multiplicative functions of the form $g \ast 1$, where the function $g$ satisfies the Ramanujan conjecture and has conjectured upper bounds on square moments of…