GoodDyson

Disturbing the Dyson conjecture (in a GOOD way) The authors describe an algorithm, which automatically conjectures, and then automatically proves, closed-form expressions extending {it F. J. Dyson’s} conjecture [see J. Math. Phys. 3, 140--156 (1962; Zbl 0105.41604)]. They note that the algorithm is fully implemented by the Mathematica package GoodDyson.m and the analogous Maple package GoodDyson, which are available from their web sites.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 8 articles , 1 standard article )

Showing results 1 to 8 of 8.
Sorted by year (citations)

  1. Károlyi, Gyula; Nagy, Zoltán Lóránt; Petrov, Fedor V.; Volkov, Vladislav: A new approach to constant term identities and Selberg-type integrals (2015)
  2. Romik, Dan: Connectivity patterns in loop percolation. I: The rationality phenomenon and constant term identities (2014)
  3. Zhou, Yue: On Kadell’s two conjectures for the $q$-Dyson product (2011)
  4. Medina, Luis A.; Zeilberger, Doron: An experimental mathematics perspective on the old, and still open, question of when to stop? (2010)
  5. Lv, Lun; Xin, Guoce; Zhou, Yue: A family of $q$-Dyson style constant term identities (2009)
  6. Gessel, Ira M.; Lv, Lun; Xin, Guoce; Zhou, Yue: A unified elementary approach to the Dyson, Morris, Aomoto, and Forrester constant term identities (2008)
  7. Sills, Andrew V.: Disturbing the Dyson conjecture, in a generally GOOD way (2006)
  8. Sills, Andrew V.; Zeilberger, Doron: Disturbing the Dyson conjecture (in a GOOD way) (2006)