Disturbing the Dyson Conjecture (in a GOOD Way)

Autor:	Doron Zeilberger, Andrew V. Sills
Rok vydání:	2018
Předmět:	Discrete mathematics Maple Conjecture General Mathematics 010102 general mathematics MathematicsofComputing_GENERAL 05-04 0102 computer and information sciences engineering.material Constant term 01 natural sciences Combinatorics Dyson conjecture 010201 computation theory & mathematics ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION engineering Computer Science::Mathematical Software FOS: Mathematics Mathematics - Combinatorics Computer Science::Symbolic Computation Dyson's conjecture Combinatorics (math.CO) 0101 mathematics Mathematics constant term
Zdroj:	Experiment. Math. 15, iss. 2 (2006), 187-192
DOI:	10.48550/arxiv.1812.04490
Popis:	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. Comment: 7 pages
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a03e690e1508ca01d28cf7043c4383bd Zobrazit plný text záznamu