Related papers: On Osculating Interpolation
In this paper, we find explicit formulas for higher order derivatives of the inverse tangent function. More precisely, we study polynomials which are induced from the higher-order derivatives of arctan(x). Successively, we give generating…
We present a novel barycentric interpolation algorithm designed for analytic functions $f\in\mathcal{A}(E)$ defined on the complex plane. The algorithm, which encompasses both polynomial and rational interpolation, is tailored to handle…
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
In this paper, we consider the problem of representing any polynomial in terms of the ordered Bell and degenerate ordered Bell polynomials, and more generally of the higher-order ordered Bell and higher-order degenerate ordered Bell…
In the present article, we study Bell based Euler polynomial of order {\alpha} and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind.…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
The paper gives an extension of Prony's method to the multivariate case which is based on the relationship between polynomial interpolation, normal forms modulo ideals and H--bases.
Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…
In this paper, we exploit the r-Stirling numbers of both kinds in order to give explicit formulae for the values of the high order Bernoulli numbers and polynomials of both kinds at integers. We give also some identities linked the…
In this paper, we introduce the degenerate multiple polyexponential functions which are multiple versions of the degenerate modified polyexponential functions. Then we consider the degenerate multi-poly-Genocchi polynomials which are…
In the present paper, we obtain new interesting relations and identities of the Apostol-Bernoulli polynomials of higher order, which are derived using a Bernoulli polynomial basis. Finally, by utilizing our method, we also derive formulas…
This paper surveys hyperinterpolation, a quadrature-based approximation scheme. We cover classical results, provide examples on several domains, review recent progress on relaxed quadrature exactness, introduce methodological variants, and…
We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…
We propose a method for constructing systems of polynomial equations that define submanifolds of degenerate binary forms of an arbitrary degeneracy degree. It is appropriate to call these systems of equations "higher discriminants".
A lemma of Micchelli's, concerning radial polynomials and weighted sums of point evaluations, is shown to hold for arbitrary linear functionals, as is Schaback's more recent extension of this lemma and Schaback's result concerning…
Differentiable real function reproducing primes up to a given number and having a differentiable inverse function is constructed. This inverse function is compared with the Riemann-Von Mangoldt exact expression for the number of primes not…
The main aim of this paper is to define and investigate a new class of the degenerate poly-Frobenius-Genocchi polynomials with the help of the polyexponential functions. In this paper, we define the degenerate poly-Frobenius-Genocchi…
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.