Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-23T01:51:27.869Z Has data issue: false hasContentIssue false

The ‘Snake Oil’ method for proving combinatorial identities

Published online by Cambridge University Press:  05 August 2013

Herbert S. Wilf
Affiliation:
University of Pennsylvania
Get access

Summary

I have recently been working on a book about generating functions. It will be called ‘Generatingfunctionology,’ and it is intended to be an upper-level undergraduate, or graduate text in the subject. The object is to try to impress students with the beauty of this subject too, so they won't think that only bijections can be lovely.

In one section of the book I will discuss combinatorial identities, and the approach will be this. First I'll give the ‘Snake Oil’ method, in the spirit of a unified approach that works on many relatively simple identities. It involves generating functions. Second, I will write about a much more powerful method that works on ‘nearly all’ identities, including all classical hypergeometric identities and many, many binomial coefficient identities.

These two approaches will be mirrored here, in that this article will mostly be about the Snake Oil method, whereas the talk that I will give at the conference will be about the much more powerful method of WZ pairs [WZ], which at this writing is still under development. A brief summary of the WZ results appears in section (II) below.

Aside from these developments, there have been other unifying forces at work in the field of identities. The expository paper of Roy [Ro], shows how even without a computer one can recognize many binomial identities as cases of just a very few identities in the theory of hypergeometric series. The work of Knuth [Kn] shows how a few rules about binomial coefficients and their handling can, in skilled hands, prove many difficult identities.

Type
Chapter
Information
Surveys in Combinatorics, 1989
Invited Papers at the Twelfth British Combinatorial Conference
, pp. 208 - 217
Publisher: Cambridge University Press
Print publication year: 1989

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×