Premium
Tauberian Theorems for Sequences linked by a Convolution
Author(s) -
Warlimont Richard
Publication year - 1998
Publication title -
mathematische nachrichten
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.913
H-Index - 50
eISSN - 1522-2616
pISSN - 0025-584X
DOI - 10.1002/mana.19981930114
Subject(s) - mathematics , convolution (computer science) , abelian and tauberian theorems , convolution power , combinatorics , pure mathematics , discrete mathematics , mathematical analysis , computer science , fourier transform , artificial intelligence , artificial neural network , fourier analysis , fractional fourier transform
Given sequences g , λ: IN 0 → C, g (0) = 1, linked by the convolution λ g = g ′ 1 ( g ′ 1 (n)= (n + 1) g (n + 1)) we study what can be inferred about λ (n → ∞) from some concrete information about the behaviour of g (n → ∞).