English
Related papers

Related papers: On convolution powers of 1/x

200 papers

In this paper, we present a new approach to the convolved Fibonacci numbers arising from the generating function of them and give some new and explicit identities for the convolved Fibonacci numbers.

Number Theory · Mathematics 2016-07-22 Taekyun Kim , Dmitry V. Dolgy , Dae san Kim , Jong-Jin Seo

We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…

Classical Analysis and ODEs · Mathematics 2023-08-17 Jing Gao , Arieh Iserles

For convex univalent functions we give instances where the sharp bound for various coefficient functionals are identical to those for the corresponding bound for the inverse function. We give instances where the sharp bounds differ and also…

Complex Variables · Mathematics 2022-12-12 Derek K. Thomas

This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Marcus H. Mendenhall

``Quasi-elliptic'' functions can be given a ring structure in two different ways, using either ordinary multiplication, or convolution. The map between the corresponding standard bases is calculated. A related structure has appeared…

Rings and Algebras · Mathematics 2021-05-13 Marianne Leitner

If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…

Classical Analysis and ODEs · Mathematics 2013-12-16 Bálint Farkas , Szilárd Révész

In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…

Number Theory · Mathematics 2022-04-11 Bartosz Sobolewski , Maciej Ulas

For the Fibonacci numbers $F_n$, we have the self-convolution formula $5 \sum_{i=0}^n F_i F_{n-i} = (2n)F_{n+1} - (n+1)F_n$. We find the corresponding self-convolution formula for the Narayana numbers $R_n$ which satisfy $R_n = R_{n-1} +…

Combinatorics · Mathematics 2026-05-22 Greg Dresden , Yuechen Xiao , Guanzhang Zhou

Different types of convolution operations involving large Vandermonde matrices are considered. The convolutions parallel those of large Gaussian matrices and additive and multiplicative free convolution. First additive and multiplicative…

Information Theory · Computer Science 2016-11-15 Ø. Ryan , M. Debbah

We consider simple rational functions $R_{mn}(x)=P_m(x)/Q_n(x)$, with $P_m$ and $Q_n$ polynomials of degree $m$ and $n$ respectively. We look for "nice" functions, which we define to be ones where as many as possible of the roots, poles,…

Number Theory · Mathematics 2013-12-09 Allan J. MacLeod

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

Computational Complexity · Computer Science 2024-02-14 David Eppstein

Using simultaneously two operator identities, we consider the inversion of the convolution operators on a rectangular. The structure of the inverse operators and of some corresponding forms, which are important in signal processing, is…

Classical Analysis and ODEs · Mathematics 2017-01-31 Alexander Sakhnovich

A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linear equation, this paper presents an absolutely…

History and Overview · Mathematics 2019-12-04 Dagnachew Jenber Negash

In this paper, we will extend the falling and rising factorial transforms \cite{ref. 1} which in this case every arbitrary function can be applied. Then, the properties of these transforms will be investigated and some corollaries will be…

Classical Analysis and ODEs · Mathematics 2023-12-19 Parham Zarghami

Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…

Functional Analysis · Mathematics 2015-04-29 V. F. Babenko , V. V. Babenko , M. V. Polischuk

Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…

Classical Analysis and ODEs · Mathematics 2022-10-25 Nicolas Brisebarre , Bruno Salvy

While transformers have proven enormously successful in a range of tasks, their fundamental properties as models of computation are not well understood. This paper contributes to the study of the expressive capacity of transformers,…

Machine Learning · Computer Science 2025-03-31 Lena Strobl , Dana Angluin , Robert Frank

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

Numerical Analysis · Mathematics 2021-11-05 Dinh Dũng , Vu Nhat Huy

We consider a self-convolutive recurrence whose solution is the sequence of coefficients in the asymptotic expansion of the logarithmic derivative of the confluent hypergeometic function $U(a,b,z)$. By application of the Hilbert transform…

Combinatorics · Mathematics 2020-02-27 Richard J. Martin , M. J. Kearney

Inversion of function sinc(x) is studied. New series and integral representations of branches of inverse function are obtained using Fourier analysis.

Classical Analysis and ODEs · Mathematics 2025-07-25 Aleksey V. Kargovsky