Related papers: Improved Stein inequalities for the Fourier transf…

The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…

In this paper we establish a version of the Paley-Wiener theorem of Fourier analysis in the frame of the Mellin transform. We provide two different proofs, one involving complex analysis arguments, namely the Riemann surface of the…

The Eulerian number A(n,k) counts permutations of n symbols with exactly k descents. Motivated by problems in cryptography, several authors have studied the proportion of permutations whose number of descents lies in a fixed congruence…

This paper examines the existence and region of convergence of Fourier transform of the functions of bicomplex variables with the help of projection on its idempotent components as auxiliary complex planes. Several basic properties of this…

The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…

The inverse tangent function can be bounded by different inequalities, for example by Shafer's inequality. In this publication, we propose a new sharp double inequality, consisting of a lower and an upper bound, for the inverse tangent…

We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is…

We study inequalities between general integral moduli of continuity of a function and the tail integral of its Fourier transform. We obtain, in particular, a refinement of a result due to D. B. H. Cline [2] (Theorem 1.1 below). We note that…

In this paper we study sharp pointwise inequalities for maximal operators. In particular, we strengthen DeVore's inequality for the moduli of smoothness and a logarithmic variant of Bennett--DeVore--Sharpley's inequality for rearrangements.…

Generalised Bayesian inference updates prior beliefs using a loss function, rather than a likelihood, and can therefore be used to confer robustness against possible mis-specification of the likelihood. Here we consider generalised Bayesian…

In this article, we establish the Fefferman-Stein inequalities for the Dunkl maximal operator associated with a finite reflection group generated by the sign changes. Similar results are also given for a large class of operators related to…

Pisier's inequality is central in the study of normed spaces and has important applications in geometry. We provide an elementary proof of this inequality, which avoids some non-constructive steps from previous proofs. Our goal is to make…

In this article, we prove several multi-term refinements of Young type inequalities for both real numbers and operators improving several known results. Among other results, we prove \begin{eqnarray*}…

This work presents a multilevel variant of Stein variational gradient descent to more efficiently sample from target distributions. The key ingredient is a sequence of distributions with growing fidelity and costs that converges to the…

A refinement of the Hardy inequality has been presented by use of superquadratic function.

In this paper the double-sided Talor's approximations are used to obtain generalisations and improvements of some trigonometric inequalities.

The classical Hausdorff-Young inequalities for the Fourier transform acting between appropriate $L_p$ spaces are cornerstones of Fourier analysis. Here we extend it to weighted spaces of Besov or Sobolev type where the weight has the form…

In this short note, we give the refined Young inequality with Specht's ratio by only elementary and direct calculations. The obtained inequality is better than one previously shown by the author in 2012. In addition, we give a new property…

We improve the understanding of the $\textit{golden ratio algorithm}$, which solves monotone variational inequalities (VI) and convex-concave min-max problems via the distinctive feature of adapting the step sizes to the local Lipschitz…

Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or…