P-recursive equation

Closed form solutions

Let $\sum _{k=0}^r{p}_k(n)y(n+k)=f(n)$ or equivalently $Ly=f$ be a recurrence equation with polynomial coefficients. There exist several algorithms which compute solutions of this equation. These algorithms can compute polynomial, rational, hypergeometric and d'Alembertian solutions. The solution of a homogeneous equation is given by the kernel of the linear recurrence operator: $\ker L=\{y\in {\mathbb{K}}^{\mathbb{N}}:Ly=0\}$. As a subspace of the space of sequences this kernel has a basis. Let $\{y^{(1)},y^{(2)},\dots ,y^{(m)}\}$ be a basis of $\ker L$, then the formal sum $c_1{y}^{(1)}+\cdots +c_m{y}^{(m)}$ for arbitrary constants $c_1,\dots ,c_m\in \mathbb{K}$ is called the general solution of the homogeneous problem $Ly=0$. If $\tilde{y}$ is a particular solution of $Ly=f$, i.e. $L\tilde{y}=f$, then $c_1{y}^{(1)}+\cdots +c_m{y}^{(m)}+\tilde{y}$ is also a solution of the inhomogeneous problem and it is called the general solution of the inhomogeneous problem.

Polynomial solutions

In the late 1980s Sergei A. Abramov described an algorithm which finds the general polynomial solution of a recurrence equation, i.e. $y(n)\in \mathbb{K}[n]$, with a polynomial right-hand side$f(n)\in \mathbb{K}[n]$. He (and a few years later Marko Petkovšek) gave a degree bound for polynomial solutions. This way the problem can simply be solved by considering a system of linear equations. In 1995 Abramov, Bronstein and Petkovšek showed that the polynomial case can be solved more efficiently by considering power series solution of the recurrence equation in a specific power basis (i.e. not the ordinary basis $(x^n{)}_{n\in \mathbb{N}}$).

The other algorithms for finding more general solutions (e.g. rational or hypergeometric solutions) also rely on algorithms which compute polynomial solutions.

Rational solutions

In 1989 Sergei A. Abramov showed that a general rational solution, i.e. $y(n)\in \mathbb{K}(n)$, with polynomial right-hand side $f(n)\in \mathbb{K}[n]$, can be found by using the notion of a universal denominator. A universal denominator is a polynomial $u$ such that the denominator of every rational solution divides $u$. Abramov showed how this universal denominator can be computed by only using the first and the last coefficient polynomial $p_0$ and $p_r$. Substituting this universal denominator for the unknown denominator of ${\displaystyle y}$ all rational solutions can be found by computing all polynomial solutions of a transformed equation.

Hypergeometric solution

A sequence $y(n)$ is called hypergeometric if the ratio of two consecutive terms is a rational function in ${\displaystyle n}$, i.e. $y(n+1)/y(n)\in \mathbb{K}(n)$. This is the case if and only if the sequence is the solution of a first-order recurrence equation with polynomial coefficients. The set of hypergeometric sequences is not a subspace of the space of sequences as it is not closed under addition.

In 1992 Marko Petkovšek gave an algorithm to get the general hypergeometric solution of a recurrence equation where the right-hand side ${\displaystyle f}$ is the sum of hypergeometric sequences. The algorithm makes use of the Gosper-Petkovšek normal-form of a rational function. With this specific representation it is again sufficient to consider polynomial solutions of a transformed equation.

A different and more efficient approach is due to Mark van Hoeij. Considering the roots of the first and the last coefficient polynomial $p_0$ and $p_r$ – called singularities – one can build a solution step by step making use of the fact that every hypergeometric sequence $y(n)$ has a representation of the form$${\displaystyle y(n)=cr(n)z^n\mathrm{\Gamma }(n-{\xi }_1{)}^{e_1}\mathrm{\Gamma }(n-{\xi }_2{)}^{e_2}\cdots \mathrm{\Gamma }(n-{\xi }_s{)}^{e_s}}$$for some $c\in \mathbb{K},z\in \overline{\mathbb{K}},s\in \mathbb{N},r(n)\in \overline{\mathbb{K}}(n),{\xi }_1,\dots ,{\xi }_s\in \overline{\mathbb{K}}$ with ${\xi }_i-{\xi }_j\notin \mathbb{Z}$ for $i\ne j$ and $e_1,\dots ,e_s\in \mathbb{Z}$. Here $\mathrm{\Gamma }(n)$ denotes the Gamma function and $\overline{\mathbb{K}}$ the algebraic closure of the field $\mathbb{K}$. Then the ${\xi }_1,\dots ,{\xi }_s$ have to be singularities of the equation (i.e. roots of $p_0$ or $p_r$). Furthermore one can compute bounds for the exponents $e_i$. For fixed values ${\xi }_1,\dots ,{\xi }_s,e_1,\dots ,e_s$ it is possible to make an ansatz which gives candidates for $z$. For a specific $z$ one can again make an ansatz to get the rational function $r(n)$ by Abramov's algorithm. Considering all possibilities one gets the general solution of the recurrence equation.

D'Alembertian solutions

A sequence ${\displaystyle y}$ is called d'Alembertian if $y=h_1\sum h_2\sum \cdots \sum h_k$ for some hypergeometric sequences $h_1,\dots ,h_k$ and $y=\sum x$ means that $\mathrm{\Delta }y=x$ where $\mathrm{\Delta }$ denotes the difference operator, i.e. $\mathrm{\Delta }y=Ny-y=y(n+1)-y(n)$. This is the case if and only if there are first-order linear recurrence operators $L_1,\dots ,L_k$ with rational coefficients such that $L_k\cdots L_{1}y=0$.

1994 Abramov and Petkovšek described an algorithm which computes the general d'Alembertian solution of a recurrence equation. This algorithm computes hypergeometric solutions and reduces the order of the recurrence equation recursively.

Examples

Signed permutation matrices

The number of signed permutation matrices of size ${\displaystyle n\times n}$ can be described by the sequence $y(n)\in {\mathbb{Q}}^{\mathbb{N}}$. A signed permutation matrix is a square matrix which has exactly one nonzero entry in every row and in every column. The nonzero entries can be $\pm 1$. The sequence is determined by the linear recurrence equation with polynomial coefficients$${\displaystyle y(n)=4(n-1{)}^{2}y(n-2)+2y(n-1)}$$and the initial values $y(0)=1,y(1)=2$. Applying an algorithm to find hypergeometric solutions one can find the general hypergeometric solution$${\displaystyle y(n)=c{2}^{n}n!}$$for some constant $c$. Also considering the initial values, the sequence $y(n)=2^{n}n!$ describes the number of signed permutation matrices.

Involutions

The number of involutions $y(n)$ of a set with $n$ elements is given by the recurrence equation$${\displaystyle y(n)=(n-1)y(n-2)+y(n-1).}$$Applying for example Petkovšek's algorithm it is possible to see that there is no polynomial, rational or hypergeometric solution for this recurrence equation.

Applications

A function $F(n,k)$ is called hypergeometric if $F(n,k+1)/F(n,k),F(n+1,k)/F(n,k)\in \mathbb{K}(n,k)$ where $\mathbb{K}(n,k)$ denotes the rational functions in $n$ and $k$. A hypergeometric sum is a finite sum of the form $f(n)=\sum _{k}F(n,k)$ where $F(n,k)$ is hypergeometric. Zeilberger's creative telescoping algorithm can transform such a hypergeometric sum into a recurrence equation with polynomial coefficients. This equation can then be solved to get for example a linear combination of hypergeometric solutions which is called a closed form solution of $f$.