Experimental Mathematics

Disturbing the Dyson Conjecture (in a GOOD Way)

Andrew V. Sills and Doron Zeilberger

Full-text: Open access

Abstract

We present a case study in experimental yet rigorous mathematics by describing an algorithm, fully implemented in both Mathematica and Maple, that automatically conjectures, and then automatically proves, closed-form expressions extending Dyson's celebrated constant-term conjecture.

Article information

Source
Experiment. Math. Volume 15, Issue 2 (2006), 187-192.

Dates
First available: 5 April 2007

Permanent link to this document
http://projecteuclid.org/euclid.em/1175789739

Mathematical Reviews number (MathSciNet)
MR2253005

Subjects
Primary: 05-04: Explicit machine computation and programs (not the theory of computation or programming)

Keywords
Dyson's conjecture constant term

Citation

Sills, Andrew V.; Zeilberger, Doron. Disturbing the Dyson Conjecture (in a GOOD Way). Experimental Mathematics 15 (2006), no. 2, 187--192. http://projecteuclid.org/euclid.em/1175789739.


Export citation