# Disturbing the Dyson Conjecture (in a GOOD Way)

## TL;DR

This paper introduces an algorithm that automatically conjectures and proves closed-form expressions related to Dyson's constant term conjecture, demonstrating a novel integration of experimental and rigorous mathematical methods.

## Contribution

It presents a fully implemented algorithm in Mathematica and Maple that automates conjecturing and proving extensions of Dyson's conjecture, advancing computational mathematics.

## Key findings

- Successfully conjectures new closed-form expressions
- Automatically proves extended Dyson conjectures
- Demonstrates the power of computational methods in mathematical discovery

## 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.