Related papers: What do sin$(x)$ and arcsinh$(x)$ have in Common?
In this paper we investigate growth properties and the zero distribution of polynomials attached to arithmetic functions $g$ and $h$, where $g$ is normalized, of moderate growth, and $0<h(n) \leq h(n+1)$. We put $P_0^{g,h}(x)=1$ and…
The proposal of Reshef et al. (2011) is an interesting new approach for discovering non-linear dependencies among pairs of measurements in exploratory data mining. However, it has a potentially serious drawback. The authors laud the fact…
We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…
We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…
We study the problem of constructing a linear sketch of minimum dimension that allows approximation of a given real-valued function $f \colon \mathbb{F}_2^n \rightarrow \mathbb R$ with small expected squared error. We develop a general…
Stochastic approximation algorithms are iterative procedures which are used to approximate a target value in an environment where the target is unknown and direct observations are corrupted by noise. These algorithms are useful, for…
In this paper, we propose a new framework to study the generalization property of classifier chains trained over observations associated with multiple and interdependent class labels. The results are based on large deviation inequalities…
This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized…
Results on the rational approximation of functions containing singularities are presented. We build further on the ''lightning method'', recently proposed by Trefethen and collaborators, based on exponentially clustering poles close to the…
In this paper we introduce two conceptual algorithms for minimising abstract convex functions. Both algorithms rely on solving a proximal-type subproblem with an abstract Bregman distance based proximal term. We prove their convergence when…
A celebrated result of Hal\'asz describes the asymptotic behavior of the arithmetic mean of an arbitrary multiplicative function with values on the unit disc. We extend this result to multilinear averages of multiplicative functions…
The numerical evaluation of an individual Bessel or Hankel function of large order and large argument is a notoriously problematic issue in physics. Recurrence relations are inefficient when an individual function of high order and argument…
Based on the joint bidiagonalization process of a large matrix pair $\{A,L\}$, we propose and develop an iterative regularization algorithm for the large scale linear discrete ill-posed problems in general-form regularization: $\min\|Lx\| \…
We consider universal approximations of symmetric and anti-symmetric functions, which are important for applications in quantum physics, as well as other scientific and engineering computations. We give constructive approximations with…
In the study of Ramanujan sums, the so-called regular $A$-function is a set-valued multiplicative function that tracks certain subsets of the divisor sets of natural numbers. McCarthy provided a generalization of the Ramanujan sum using…
The idea behind Poisson approximation to the binomial distribution was used in [J. de la Cal, F. Luquin, J. Approx. Theory, 68(3), 1992, 322-329] and subsequent papers in order to establish the convergence of suitable sequences of positive…
Siegel in 1932 published a paper on Riemann's posthumous writings, including a study of the Riemann-Siegel formula. In this paper we explicitly give the asymptotic developments of $\mathop{\mathcal R }(s)$ suggested by Siegel. We extend the…
Let $X$ be a scheme of finite type over a finite field $k$, and let $\mathcal L X$ denote its arc space; in particular, $\mathcal L X(k) = X(k[[t]])$. Using the theory of Grinberg, Kazhdan, and Drinfeld on the finite-dimensionality of…
In the manuscript, we present a practical way to find the matching priors proposed by Welch & Peers (1963) and Peers (1965). We investigate the use of saddlepoint approximations combined with matching priors and obtain p-values of the test…
In contrast with the well-known methods of matching asymptotics and multiscale (or compound) asymptotics, the " functional analytic approach " of Lanza de Cristoforis (Analysis 28, 2008) allows to prove convergence of expansions around…