Proof of a determinant evaluation conjectured by Bombieri, Hunt and van Poorten

MaRDI QIDQ1384585zbMATH OpenFDO

Authors C. Krattenthaler, Doron Zeilberger

Publication date 16 April 1998

Published in The New York Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9806042, https://eudml.org/doc/119550, http://www.emis.de/journals/NYJM/j/1997/3-4.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

binomialsdeterminanthypergeometric series

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Matrices, determinants in number theory (11C20) Determinants, permanents, traces, other special matrix functions (15A15)

Abstract: A determinant evaluation is proven, a special case of which establishes a conjecture of Bombieri, Hunt, and van der Poorten (Experimental Math. {�f 4} (1995), 87--96) that arose in the study of Thue's method of approximating algebraic numbers.

Review text

The authors join their respective techniques to evaluate the following determinant. Given nonnegative integers \(c \leq b\), the entry in row \(i\), column \(j\) is \[ \begin{aligned} \binom {x+j}{i}, &\qquad 0 \leq i \leq c,\;0 \leq j < b \;\text{ or } c \leq i < b,\;c \leq j < b,\\ \binom{2x+j} {i}, &\qquad 0 \leq i < b,\;b \leq j < b+c,\\ 2\binom{x+j} {i-b}, &\qquad b \leq i < b+c,\;0 \leq j < c,\\ \binom{x+j} {i-b}, &\qquad b \leq i < b+c,\;c \leq j < b,\\ 0, &\qquad \text{otherwise}. \end{aligned} \] The case \(x=0\) was a conjecture of \textit{E. Bombieri, D. C. Hunt}, and \textit{A. J. van der Poorten} [Exp. Math. 4, No. 2, 87-96 (1995; Zbl 0862.11029)].

Recommendations

• Proof of a conjecture on determinants of matrices whose entries arise as recurrences
• Binomial determinant evaluations
• Three determinant evaluations
• Evaluation of a family of binomial determinants
• Advanced determinant calculus

Cited in

(7)

• The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I
• The number of centered lozenge tilings of a symmetric hexagon
• Determinants of \(q\)-hypergeometric functions and another proof of the Askey conjecture
• A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration
• A high-tech proof of the Mills-Robbins-Rumsey determinant formula
• Some composition determinants
• Evaluation of a family of binomial determinants

This page was built for publication: Proof of a determinant evaluation conjectured by Bombieri, Hunt and van Poorten

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384585)