REVIEW 1 cited by
The Graham--Knuth--Patashnik recurrence: Symmetries and continued fractions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We study the triangular array defined by the Graham--Knuth--Patashnik recurrence $T(n,k) = (\alpha n + \beta k + \gamma)\, T(n-1,k)+(\alpha' n + \beta' k + \gamma') \, T(n-1,k-1)$ with initial condition $T(0,k) = \delta_{k0}$ and parameters $\mathbf{\mu} = (\alpha,\beta,\gamma, \alpha',\beta',\gamma')$. We show that the family of arrays $T(\mathbf{\mu})$ is invariant under a 48-element discrete group isomorphic to $S_3 \times D_4$. Our main result is to determine all parameter sets $\mathbf{\mu} \in \mathbb{C}^6$ for which the ordinary generating function $f(x,t) = \sum_{n,k=0}^\infty T(n,k) \, x^k t^n$ is given by a Stieltjes-type continued fraction in $t$ with coefficients that are polynomials in $x$. We also exhibit some special cases in which $f(x,t)$ is given by a Thron-type or Jacobi-type continued fraction in $t$ with coefficients that are polynomials in $x$.
Forward citations
Cited by 1 Pith paper
-
Log-concavity and log-convexity in the theory of the Graham--Knuth--Patashnik recurrences
GKP arrays T(n,k;µ) are coefficientwise strongly log-concave and their generating polynomials Pn(x;µ) are coefficientwise strongly log-convex (hence Hankel-TP2) when parameters are indeterminates.
Discussion (0). Continue with ORCID to comment.