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

In this article, we establish an improvement of the Cauchy-Schwarz inequality. Let $x, y \in \mathcal{H},$ and let $f: (0,1) \rightarrow \mathbb{R}^+$ be a well-defined function, where $\mathbb{R}^+$ denote the set of all positive real…

We establish fine bounds for best constants of the fractional subcritical Sobolev embeddings \begin{align*} W_{0}^{s,p}\left(\Omega\right)\hookrightarrow L^{q}\left(\Omega\right), \end{align*} where $N\geq1$, $0<s<1$, $p=1,2$, $1\leq…

Debugging accumulation of floating-point errors is hard; ideally, computer should track it automatically. Here we consider twofold approximation of an exact real with value + error pair of floating-point numbers. Normally, value + error sum…

We study the decomposition of real numbers into sums of L\"uroth sets, which are defined by numbers whose L\"uroth expansions have prescribed digit constraints. We establish several results on the congruence modulo 1 of sums of L\"uroth…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the…

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

This paper contributes to the study of the free additive convolution of probability measures. It shows that under some conditions, if measures $\mu_i$ and $\nu_i, i=1,2$, are close to each other in terms of the L\'{e}vy metric and if the…

We provide sharp bounds for the supremum of countably many stochastic convolutions taking values in a 2-smooth Banach space. As a consequence, we obtain sharp bounds on the modulus of continuity of a family of stochastic integrals indexed…

In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…

This paper develops a constructive numerical scheme for Fourier-Bessel approximations on disks compatible with convolutions supported on disks. We address accurate finite Fourier-Bessel transforms (FFBT) and inverse finite Fourier-Bessel…

The uneven distribution of digits in numerical data, known as Benford's law, was discovered in 1881. Since then, this law has been shown to be correct in copious numerical data relating to economics, physics and even prime numbers. Although…

We study the hyperbolic sine-Gordon model, with a parameter $\be^2 > 0$, and its associated Gibbs dynamics on the two-dimensional torus. By introducing a physical space approach to the Fourier restriction norm method and establishing…

Let $f$ be analytic in the unit disk and $\mathcal{S}$ be the subclass of normalized univalent functions with $f(0) = 0$, and $f'(0) = 1$. Let $F$ be the inverse function of $f$, given by $F(w)=w+\sum_{n=2}^{\infty}A_nw^n$ defined on some…

The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined…

Common proofs of the Gagliardo-Nirenberg-Sobolev (GNS) do not provide explicit bounds on the involved constants, unless a sharp constant is being determined. GNS inequalities naturally occur in error estimates for numerical approximations.…

We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue…

For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…