Lindelöf representations and (non-)holonomic sequences
A sequence \((f_n)_{ n \geq 0 }\) is \textit{holonomic} (or \textit{P-recursive}) if \[ p_0(n) f_{ n+d } + p_1(n) f_{ n+d-1 } + \cdots + p_d(n) f_n = 0 , \qquad n \geq 0, \] for some polynomials \(p_j\). Many combinatorial sequences of common interest, e.g., a wide class of sums involving binomial coefficients, are holonomic. The article constructs an complex-analytic machinery (structure theorem for singularities of solutions to linear differential equation, Abelian theorem) for proving that a sequence is \textit{not} holonomic. It confirms three open conjectures, namely that the sequences \((\log n)\), \(( n^\alpha)\) for a fixed \(\alpha \in {\mathbb C} \setminus {\mathbb Z}\), and the sequence of primes is not holonomic.
- Singularity analysis for heavy-tailed random variables
- On some non-holonomic sequences
- Asymptotic expansion of Mathieu power series and trigonometric Mathieu series
- Linear differential equations as a data structure
- On the non-holonomic character of logarithms, powers, and the \(n\)th prime function
- Difference Equation Theory Meets Mathematical Finance
- The generalized weighted probability measure on the symmetric group and the asymptotic behavior of the cycles
- A representation theorem for (q-)holonomic sequences
- On the number of antipodal bicolored necklaces
- Non-holonomicity of sequences defined via elementary functions
This page was built for publication: Lindelöf representations and (non-)holonomic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380433)
