2010
DOI: 10.1007/s00010-010-0051-0
|View full text |Cite
|
Sign up to set email alerts
|

An exactly solvable self-convolutive recurrence

Abstract: Abstract. 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 we convert this expression into an explicit, non-recursive solution in which the nth coefficient is expressed as the (n − 1)th moment of a measure, and also as the trace of the (n − 1)th iterate of a linear operator. Applications of these sequences, and hence of th… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
23
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(23 citation statements)
references
References 18 publications
0
23
0
Order By: Relevance
“…Thus for example one cannot immediately recover the (u n ) from G via integral formulae. On the other hand, by treating it as the asymptotic expansion of a recognisable function that, on account of the recurrence, obeys a differential equation, one can obtain analytical results: that is the key insight of [6]. Of course it may be that the asymptotic series is in fact convergent; it then produces the same results as do standard techniques.…”
mentioning
confidence: 62%
See 3 more Smart Citations
“…Thus for example one cannot immediately recover the (u n ) from G via integral formulae. On the other hand, by treating it as the asymptotic expansion of a recognisable function that, on account of the recurrence, obeys a differential equation, one can obtain analytical results: that is the key insight of [6]. Of course it may be that the asymptotic series is in fact convergent; it then produces the same results as do standard techniques.…”
mentioning
confidence: 62%
“…In a recent paper [6] we studied in some detail the sequence defined by the self-convolutive recurrence (1) u n = (α 1 n + α 2 )u n−1 + α 3 n−1 j=1 u j u n−j , u 1 = 1, and showed how to derive a closed-form solution which, under mild assumptions discussed in [6], is…”
mentioning
confidence: 99%
See 2 more Smart Citations
“…Thus This is a recurrence relation for the number of rooted triangulations on n darts (equivalently, n/3 triangles). The corresponding number sequence can be also expressed as the S(6, −8, 1) sequence from [22]. Example 5.3.…”
Section: The Riccati Hierarchy and Recurrence Relationsmentioning
confidence: 99%