Disturbing the Dyson Conjecture (in a GOOD Way)

Sills, Andrew V.; Zeilberger, Doron

Experiment. Math., Tome 15 (2006) no. 1, p. 187-192 / Harvested from Project Euclid

Résumé

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.

Publié le : 2006-05-15
Classification: Dyson's conjecture, constant term, 05-04

@article{1175789739,
     author = {Sills, Andrew V. and Zeilberger, Doron},
     title = {Disturbing the Dyson Conjecture (in a GOOD Way)},
     journal = {Experiment. Math.},
     volume = {15},
     number = {1},
     year = {2006},
     pages = { 187-192},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1175789739}
}

Sills, Andrew V.; Zeilberger, Doron. Disturbing the Dyson Conjecture (in a GOOD Way). Experiment. Math., Tome 15 (2006) no. 1, pp.  187-192. http://gdmltest.u-ga.fr/item/1175789739/