Disturbing the Dyson conjecture (In a GOOD way)

Andrew V. Sills; Doron Zeilberger

doi:10.1080/10586458.2006.10128959

Disturbing the Dyson conjecture (In a GOOD way)

Andrew V. Sills, Doron Zeilberger

Mathematical Sciences

Rutgers, The State University of New Jersey

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	187-191
Number of pages	5
Journal	Experimental Mathematics
Volume	15
Issue number	2
DOIs	https://doi.org/10.1080/10586458.2006.10128959
State	Published - 2006

Scopus Subject Areas

General Mathematics

Keywords

Constant term
Dyson’s conjecture

Access to Document

10.1080/10586458.2006.10128959

Cite this

@article{a53c36cdcf134be18a9b24dd89a1065a,

title = "Disturbing the Dyson conjecture (In a GOOD way)",

abstract = "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{\textquoteright}s celebrated constant-term conjecture.",

keywords = "Constant term, Dyson{\textquoteright}s conjecture",

author = "Sills, \{Andrew V.\} and Doron Zeilberger",

year = "2006",

doi = "10.1080/10586458.2006.10128959",

language = "English",

volume = "15",

pages = "187--191",

journal = "Experimental Mathematics",

issn = "1058-6458",

publisher = "Taylor and Francis Ltd.",

number = "2",

}

TY - JOUR

T1 - Disturbing the Dyson conjecture (In a GOOD way)

AU - Sills, Andrew V.

AU - Zeilberger, Doron

PY - 2006

Y1 - 2006

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

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

KW - Constant term

KW - Dyson’s conjecture

UR - https://www.scopus.com/pages/publications/33749254306

U2 - 10.1080/10586458.2006.10128959

DO - 10.1080/10586458.2006.10128959

M3 - Article

SN - 1058-6458

VL - 15

SP - 187

EP - 191

JO - Experimental Mathematics

JF - Experimental Mathematics

IS - 2

ER -

Disturbing the Dyson conjecture (In a GOOD way)

Abstract

Scopus Subject Areas

Keywords

Access to Document

Other files and links

Cite this