Related papers: Best rational approximation of functions with loga…
For the Riesz and logarithmic potentials, we consider greedy energy sequences $(a_n)_{n=0}^\infty$ on the unit circle $S^1$, constructed in such a way that for every $n\geq 1$, the discrete potential generated by the first $n$ points…
Let $\XX$ be a compact, smooth, connected, Riemannian manifold without boundary, $G:\XX\times\XX\to \RR$ be a kernel. Analogous to a radial basis function network, an eignet is an expression of the form $\sum_{j=1}^M a_jG(\circ,y_j)$, where…
We show that describing rational functions $f_1,$ $f_2,$ $\dots,f_n$ sharing the measure of maximal entropy reduces to describing solutions of the functional equation $A\circ X_1=A\circ X_2=\dots=A\circ X_n$ in rational functions. We also…
We show that a well-known asymptotic series for the logarithm of the central binomial coefficient is strictly enveloping in the sense of P\'olya and Szeg\"o, so the error incurred in truncating the series is of the same sign as the next…
We compare the asymptotic behavior of Carmichael's lambda function composed with Euler's totient function to the asymptotic behavior of Carmichael's lambda function composed with itself. We establish the normal order of the logarithm of the…
Within the framework of many-particle perturbation theory, we develop an analytical approach that allows us to determine the small distance behavior of Green's functions and related quantities in electronic structure theory. As a case…
We prove a general functional limit theorem for multiparameter fractional Brownian motion. The functional law of the iterated logarithm, functional L\'{e}vy's modulus of continuity and many other results are its particular cases.…
We demonstrate how to devise a Matsubara-formalism-based one-loop approximation to the flow of the functional renormalization group (FRG) that reproduces identically the leading-logarithmic parquet approximation. This construction of a…
A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…
It is known that local zeta functions associated with real analytic functions can be analytically continued as meromorphic functions to the whole complex plane. In this paper, the case of specific (non-real analytic) smooth functions is…
This paper concerns the behaviour of the apsidal angle for orbits of central force system with homogenous potential of degree $-2\leq \alpha\leq 1$ and logarithmic potential. We derive a formula for the apsidal angle as a fixed-end points…
We design a nonadaptive algorithm that, given oracle access to a function $f: \{0,1\}^n \to \{0,1\}$ which is $\alpha$-far from monotone, makes poly$(n, 1/\alpha)$ queries and returns an estimate that, with high probability, is an…
Operator convex functions defined on the positive half-line play a prominent role in the theory of quantum information, where they are used to define quantum $f$-divergences. Such functions admit integral representations in terms of…
We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these…
We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…
We give an intrinsic characterization of the restrictions of Sobolev, Triebel-Lizorkin and Besov spaces to regular subsets of $R^n$ via sharp maximal functions and local approximations.
The aim of this paper is to study the problem of the integration of Stepanov remotely almost periodic functions. We prove that every compact primitive of a Stepanov remotely almost periodic function with a minimal $\omega$-limit set is…
Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…
We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the…
Brownian motion and scaled and interpolated simple random walk can be jointly embedded in a probability space in such a way that almost surely the $n$-step walk is within a uniform distance $O(n^{-1/2}\log n)$ of the Brownian path for all…