Related papers: The first 128 digits of an autoconvolution inequal…

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…

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 /…

Let $f$ be a nonnegative function supported on $(-1/4, 1/4)$. We show $$ \sup_{x \in \mathbb{R}}{\int_{\mathbb{R}}{f(t)f(x-t)dt}} \geq 1.28\left(\int_{-1/4}^{1/4}{f(x)dx} \right)^2,$$ where 1.28 improves on a series of earlier results. The…

We construct a nonnegative step function comprising 2,399 equally spaced intervals such that \[ \frac{\|f * f\|_{L^{2}(\mathbb{R})}^{2}}{\|f * f\|_{L^{\infty}(\mathbb{R})}\,\|f * f\|_{L^{1}(\mathbb{R})}} \;\ge\; .926529. \] Using a 4x…

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 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…

We prove that the algorithm of [13] for approximating the Hausdorff dimension of dynamically defined Cantor sets, using periodic points of the underlying dynamical system, can be used to establish completely rigorous high accuracy bounds on…

We give a nonnegative step function with 575 equally spaced intervals such that $$\frac{\|f \ast f\|_{L^{2}(\mathbb{R})}^{2}}{\|f \ast f\|_{L^{\infty}(\mathbb{R})}\|f \ast f\|_{L^{1}(\mathbb{R})}} \geq 0.901564.$$ This improves upon a…

We gain tight rigorous bounds on the renormalisation fixed point function for period doubling in families of unimodal maps with degree 2 critical point. By writing the relevant eigenproblems in a modified nonlinear form, we use these…

We consider numbers formed by concatenating some of the base b digits from additive functions f(n) that closely resemble the prime counting function \Omega(n). If we concatenate the last \lceil y \frac{\log \log \log n}{\log b} \rceil…

The integrality of Ooguri-Vafa disk invariants is verified using discrete symmetries of the superpotential of the mirror Landau-Ginzburg theory to calculate quantum corrections to the boundary variables. We show that these quantum…

For countably infinite IFSs on $\mathbb R^2$ consisting of affine contractions with diagonal linear parts, we give conditions under which the affinity dimension is an upper bound for the Hausdorff dimension and a lower bound for the lower…

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

Deriving sharp and computable upper bounds of the Lipschitz constant of deep neural networks is crucial to formally guarantee the robustness of neural-network based models. We analyse three existing upper bounds written for the $l^2$ norm.…

We consider functions of the type $f(z)=z+a_2z^2+a_3z^3+\cdots$ from a family of all analytic and univalent functions in the unit disk. Let $F$ be the inverse function of $f$, given by $F(z)=w+\sum_{n=2}^{\infty}A_nw^n$ defined on some…

Let function $f$ be analytic in the unit disk ${\mathbb D}$ and be normalized so that $f(z)=z+a_2z^2+a_3z^3+\cdots$. In this paper we give sharp bounds of the modulus of its second, third and fourth coefficient, if $f$ satisfies \[…

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11\% of the time, as one would expect if all digits were equally likely, but rather 30\%. This phenomenon is known…

Many systems exhibit a digit bias. For example, the first digit base 10 of the Fibonacci numbers, or of $2^n$, equals 1 not 10% or 11% of the time, as one would expect if all digits were equally likely, but about 30% of the time. This…

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 derive two probabilistic bounds for the relative forward error in the floating point summation of $n$ real numbers, by representing the roundoffs as independent, zero-mean, bounded random variables. The first probabilistic bound is based…