Related papers: Analytic approximation of rational matrix function…
We prove mixed inequalities for the generalized maximal operator $M_\Phi$ when the function $v$ is a radial power function that fails to be locally integrable. Concretely, let $u$ be a weight, $v(x)=|x|^\beta$ with $\beta<-n$ and $r\geq 1$.…
We recall that diagonals of rational functions naturally occur in lattice statistical mechanics and enumerative combinatorics. We find that a seven-parameter rational function of three variables with a numerator equal to one (reciprocal of…
We consider the pointwise approximation of a subharmonic function by the logarithm of the modulus of an entire function up to a bounded quantity. In the case of finite order an estimate from below of the planar Lebesgue measure of an…
We construct an analytic self-map $\Phi$ of the bidisk ${\mathbb D}^2$ whose image touches the distinguished boundary, but whose approximation numbers of the associated composition operator on $H^2 ({\mathbb D}^2)$ are small in the sense…
We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…
We consider a piecewise analytic real expanding map $f: [0,1]\to [0,1]$ of degree $d$ which preserves orientation, and a real analytic positive potential $g: [0,1] \to \mathbb{R}$. We assume the map and the potential have a complex analytic…
We study function estimation in the empirical Bayes setting for Poisson and normal means. Specifically, given observations $Y_i\sim f(\cdot; \theta_i)$ with latent parameters $\theta_i\sim \pi$, the goal is to estimate…
We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…
Finite differences have been widely used in mathematical theory as well as in scientific and engineering computations. These concepts are constantly mentioned in calculus. Most frequently-used difference formulas provide excellent…
A function $f\colon\mathbb R\to\mathbb R$ is called \emph{$k$-monotone} if it is $(k-2)$-times differentiable and its $(k-2)$nd derivative is convex. A point set $P\subset\mathbb R^2$ is \emph{$k$-monotone interpolable} if it lies on a…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
The main purpose of this note is to provide an algorithm for approximating the value of the balanced $p$-adic $L$-function, as constructed in [Hsi21], at the point $(2,1,1)$, which is lying outside of the interpolation region. The…
The traditional view in numerical conformal mapping is that once the boundary correspondence function has been found, the map and its inverse can be evaluated by contour integrals. We propose that it is much simpler, and 10-1000 times…
We calculate the least upper bounds for approximations in the metric of the space $L_2$ by linear methods of summation of Fourier series on classes of periodic functions $L^\psi_{\bar\beta,1}$ defined by sequences of multipliers…
On any metric space, I provide an intrinsic characterization of those complex-valued functions which are uniform limits of Lipschitz functions. There are applications to function theory on complete Riemannian manifolds and, in particular,…
Let $K$ be a number field and let $\phi$ in $K(z)$ be a rational function of degree $d\geq 2$. Let $S$ be the places of bad reduction for $\phi$ (including the archimedan places). Let $Per(\phi,K)$, $PrePer(\phi, K)$, and $Tail(\phi,K)$ be…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the…
Using polynomial interpolation, along with structural properties of the family of positive real rational functions, we here show that a set of m nodes in the open left half of the complex plane, can always be mapped to anywhere in the…
The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios…