Disturbing the Dyson Conjecture (in a GOOD Way)
Combinatorics
2018-12-12 v1
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.
Cite
@article{arxiv.1812.04490,
title = {Disturbing the Dyson Conjecture (in a GOOD Way)},
author = {Andrew V. Sills and Doron Zeilberger},
journal= {arXiv preprint arXiv:1812.04490},
year = {2018}
}
Comments
7 pages