English

Multidimensional Pad\'e approximation of binomial functions: Equalities

Number Theory 2021-09-07 v2 Numerical Analysis Numerical Analysis

Abstract

Let ω0,,ωM\omega_0,\dots,\omega_M be complex numbers. If H0,,HMH_0,\dots,H_M are polynomials of degree at most ρ0,,ρM\rho_0,\dots,\rho_M, and G(z)=m=0MHm(z)(1z)ωmG(z)=\sum_{m=0} ^M H_m(z) (1-z)^{\omega_m} has a zero at z=0z=0 of maximal order (for the given ωm,ρm\omega_m,\rho_m), we say that H0,,HMH_0,\dots,H_M are a \emph{multidimensional Pad\'e approximation of binomial functions}, and call GG the Pad\'e remainder. We collect here with proof all of the known expressions for GG and HmH_m, including a new one: the Taylor series of GG. We also give a new criterion for systems of Pad\'e approximations of binomial functions to be perfect (a specific sort of independence used in applications).

Keywords

Cite

@article{arxiv.2108.00549,
  title  = {Multidimensional Pad\'e approximation of binomial functions: Equalities},
  author = {Michael A. Bennett and Greg Martin and Kevin O'Bryant},
  journal= {arXiv preprint arXiv:2108.00549},
  year   = {2021}
}

Comments

30 pages, ancillary Mathematica notebook

R2 v1 2026-06-24T04:44:03.789Z