Related papers: On convolution powers of 1/x
Let x(n) be a recurrence relation. The main purpose of this article is to determine a recurrence for powers of x(n).
In this paper, we study polynomials of the form $f(x)=(x^n+x^{n-1}+...+1)^l$ for $l=1,2,3,4$ to generate a pattern titled "unique coefficient pattern". Namely, we analyze each unique coefficient patterns of $f(x)$ and generate functions…
We give estimates for the convolution product of an arbitrary number of endlessly continuable functions. This allows us to deal with nonlinear operations for the corresponding resurgent series, e.g. substitution into a convergent power…
By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…
We study the recurrence of the product of n functions, each of which satisfies the same recurrence relation.
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
An analytical approach to convolution of functions, which appear in perturbative calculations, is discussed. An extended list of integrals is presented.
Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…
In this paper Fourier transform of multivariate orthogonal polynomials on the simplex is presented. A new family of multivariate orthogonal functions is obtained by using the Parseval's identity and several recurrence relations are derived.
We study the convolution function $$ C[f(x)] := \int_1^x f(y)f({x\over y}) {{\rm d} y\over y} $$ when $f(x)$ is a suitable number-theoretic error term. Asymptotics and upper bounds for $C[f(x)]$ are derived from mean square bounds for…
In this paper we study the coefficients of the powers of an ordinary generating function and their properties. A new class of functions based on compositions of an integer $n$ is introduced and is termed composita. We present theorems about…
Fracture functions and their evolution equations are reviewed. Some phenomenological applications are briefly discussed.
We study the convolution of functions of the form \[ f_\alpha (z) := \dfrac{\left( \frac{1 + z}{1 - z} \right)^\alpha - 1}{2 \alpha}, \] which map the open unit disk of the complex plane onto polygons of 2 edges when $\alpha\in(0,1)$. We…
The polynomials that arise as coefficients when a power series is raised to the power $x$ include many important special cases, which have surprising properties that are not widely known. This paper explains how to recognize and use such…
Let $I_n(x)=\prod_{i=1}^n \left( 1+x^{F_{i+1}}\right)$, where $F_{i+1}$ denotes a Fibonacci number. Let $v_r(n)$ denote the sum of the $r$th powers of the coefficients of $I_n(x)$. Our prototypical result is that $\sum_{n\geq 0} v_2(n)x^n=…
The existence of a homogeneous decomposition for continuous and epi-translation invariant valuations on super-coercive functions is established. Continuous and epi-translation invariant valuations that are epi-homogeneous of degree $n$ are…
In this paper we aim to generalize results obtained in the framework of fractional calculus by the way of reformulating them in terms of operator theory. In its own turn, the achieved generalization allows us to spread the obtained…
All continuous, SL$(n)$ and translation invariant valuations on the space of convex functions on ${\mathbb R}^n$ are completely classified.
Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…