English
Related papers

Related papers: A note on Taylor expansion of real function

200 papers

We study the approximation error $\varepsilon(x)=\operatorname{li}_{*}(x)-\operatorname{li}(x)$ arising from the classical Stieltjes asymptotic expansion for the logarithmic integral. Our analysis is based on the discrete values…

Number Theory · Mathematics 2026-01-01 Jonatan Gomez

We propose a novel foundation for calculus that focuses on the notion of approximations while avoiding the use of limits altogether. Continuity is defined as approximation at a point, while differentiability is defined as approximation with…

History and Overview · Mathematics 2025-10-27 Michael P. Lamoureux , Matt Yedlin

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

In this paper we study Hankel operators in the quaternionic setting. In particular we prove that they can be exploited to measure the $L^{\infty}$ distance of a slice $L^{\infty}$ function from the space of bounded slice regular functions.

Complex Variables · Mathematics 2016-11-16 Giulia Sarfatti

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…

Numerical Analysis · Mathematics 2023-08-24 Matthew Streeter , Joshua V. Dillon

We study how well functions over the boolean hypercube of the form $f_k(x)=(|x|-k)(|x|-k-1)$ can be approximated by sums of squares of low-degree polynomials, obtaining good bounds for the case of approximation in $\ell_{\infty}$-norm as…

Computational Complexity · Computer Science 2016-03-09 Troy Lee , Anupam Prakash , Ronald de Wolf , Henry Yuen

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some methods of this approximation for functions in a class induced by the convolution with a given function,…

Numerical Analysis · Mathematics 2017-03-01 Dinh Dũng , Charles A. Micchelli , Vu Nhat Huy

We investigate the approximation of quadratic Dirichlet $L$-functions over function fields by truncations of their Euler products. We first establish representations for such $L$-functions as products over prime polynomials times products…

Number Theory · Mathematics 2018-02-14 J. C. Andrade , S. M. Gonek , J. P. Keating

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

Let $s_0,s_1,\dots,s_{m-1}$ be complex numbers and $r_0,\dots,r_{m-1}$ rational integers in the range $0\le r_j\le m-1$. Our first goal is to prove that if an entire function $f$ of sufficiently small exponential type satisfies…

Number Theory · Mathematics 2020-11-11 Michel Waldschmidt

Several questions of approximation theory are discussed: 1) can one approximate stably in $L^\infty$ norm $f^\prime$ given approximation $f_\delta, \parallel f_\delta - f \parallel_{L^\infty} < \delta$, of an unknown smooth function $f(x)$,…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. G. Ramm

We obtain approximation formulas for fractional integrals and derivatives of Riemann-Liouville and Marchaud types with a variable fractional order. The approximations involve integer-order derivatives only. An estimation for the error is…

Classical Analysis and ODEs · Mathematics 2013-10-29 Ricardo Almeida , Delfim F. M. Torres

We show that every real polynomial $f$ nonnegative on $[-1,1]^{n}$ can be approximated in the $l_{1}$-norm of coefficients, by a sequence of polynomials $\{f_{\ep r}\}$ that are sums of squares. This complements the existence of s.o.s.…

Algebraic Geometry · Mathematics 2007-05-23 Jean B. Lasserre , Tim Netzer

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

Number Theory · Mathematics 2022-10-03 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Florian Luca

Truncating the Fourier transform averaged by means of a generalized Hausdorff operator, we approximate the adjoint to that Hausdorff operator of the given function. We find the formulas for the rate of approximation in various metrics in…

Classical Analysis and ODEs · Mathematics 2019-07-31 Alberto Debernardi , Elijah Liflyand

Transcendental Liouvillian extensions are differential fields, in which one can model poly-logarithmic, hyperexponential, and trigonometric functions, logarithmic integrals, and their (nested) rational expressions. For such an extension…

Symbolic Computation · Computer Science 2026-02-04 Shaoshi Chen , Hao Du , Yiman Gao , Hui huang , Wenqiao Li , Ziming Li

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

Number Theory · Mathematics 2010-12-02 Adam J. Harper

Fractional calculus is the calculus of differentiation and integration of non-integer orders. In a recently paper (Annals of Physics 323 (2008) 2756-2778), the Fundamental Theorem of Fractional Calculus is highlighted. Based on this…

Mathematical Physics · Physics 2009-10-30 Ming-Fan Li , Ji-Rong Ren , Tao Zhu

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…

Complex Variables · Mathematics 2019-11-22 Catherine Bénéteau , Myrto Manolaki , Daniel Seco

Let $E$ be an arbitrary subset of the unit circle $T$ and let $f$ be a function defined on $E$. When there exist polynomials $P_n$ which are uniformly bounded by a number $M > 0$ on $T$ and converge (pointwise) to $f$ at each point of $E$?…

Complex Variables · Mathematics 2015-01-05 Arthur A. Danielyan