Search arXivSearch

arXiv · 2008.03070

The Graham--Knuth--Patashnik recurrence: Symmetries and continued fractions

Abstract

We study the triangular array defined by the Graham--Knuth--Patashnik recurrence $T(n,k) = (αn + βk + γ)\, T(n-1,k)+(α' n + β' k + γ') \, T(n-1,k-1)$ with initial condition $T(0,k) = δ_{k0}$ and parameters $\mathbfμ = (α,β,γ, α',β',γ')$. We show that the family of arrays $T(\mathbfμ)$ 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μ \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$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jesús Salas, Alan D. Sokal. 2021-05-10. The Graham--Knuth--Patashnik recurrence: Symmetries and continued fractions. https://doi.org/10.37236/9766

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO