Dixon's Identity

In mathematics, Dixon's identity (or Dixon's theorem or Dixon's formula) is any of several different but closely related identities proved by A. C. Dixon, some involving finite sums of products of three binomial coefficients, and some evaluating a hypergeometric sum. These identities famously follow from the MacMahon Master theorem, and can now be routinely proved by computer algorithms .

Statements

The original identity, from , is

:$\sum_^(-1)^^3 =\frac.$

A generalization, also sometimes called Dixon's identity, is

:$\sum_(-1)^k = \frac$

where ''a'', ''b'', and ''c'' are non-negative integers .
The sum on the left can be written as the terminating well-poised hypergeometric series
:$_3F_2(-2a,-a-b,-a-c;1+b-a,1+c-a;1)$
and the identity follows as a limiting case (as ''a'' tends to an integer) of
Dixon's theorem evaluating a well-poised ₃''F''₂ generalized hypergeometric series at 1, from :

:$\;_3F_2 (a,b,c;1+a-b,1+a-c;1)= \frac .$
This holds for Re(1 + ''a'' − ''b'' − ''c'') > 0. As ''c'' tends to −∞ it reduces to Kummer's formula for the hypergeometric function ₂F₁ at −1. Dixon's theorem can be deduced from the evaluation of the Selberg integral.

''q''-analogues

A ''q''-analogue of Dixon's formula for the basic hypergeometric series in terms of the q-Pochhammer symbol is given by
:\;_\phi_3 \left begin
a & -qa^ & b & c \\
&-a^ & aq/b & aq/c \end
; q,qa^/bc \right=
\frac

where , ''qa''^1/2/''bc'', < 1.

References

*
*
*
*
*
* {{citation , last=Wilf , first=Herbert S. , authorlink=Herbert Wilf , title=Generatingfunctionology , edition=2nd , location=Boston, MA , publisher=Academic Press , year=1994 , isbn=0-12-751956-4 , zbl=0831.05001

Enumerative combinatorics
Factorial and binomia