Disturbing the Dyson Conjecture (in a GOOD Way)
classification
🧮 math.CO
keywords
automaticallyconjecturedysonalgorithmcasecelebratedclosed-formconjectures
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.