paper

Disturbing the Dyson Conjecture (in a GOOD Way)

arXiv:1812.04490 · doi:10.1080/10586458.2006.10128959

Abstract

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

7 pages

Cited by in corpus (1)

Disturbing the Dyson Conjecture (in a GOOD Way) · wovepaper