Symbolic Combinatorics

From SIAG-AG

Revision as of 11:45, 24 November 2014 by Blekherman (Talk | contribs)
(diff) ←Older revision | Current revision (diff) | Newer revision→ (diff)
Jump to: navigation, search

In recent years algorithms and software have been developed that allow researchers to discover and verify combinatorial identities as well as understand analytic and algebraic properties of generating functions. The interaction of combinatorics and symbolic computation has had a beneficial impact on both fields. This minisymposium will feature 8 speakers describing recent research combining these areas.

  • Cyril Banderier (Universite de Paris XIII), "Combinatorics and asymptotics: beyond the D-finite world"
  • Felix Breuer (RISC, Austria)
  • Shishuo Fu (Penn State)
  • Tomack Gilmore (Universität Wien)
  • Qinghu Hou (Nankai University) "Congruences of Truncated Hypergeometric Series and Zeilberger's Algorithm"
  • Arthur Libo Yang (Nankai University)
  • Eric Rowland (University of Liège) "Computing congruences for combinatorial sequences"
  • Rika Yatchak (NC State) "D-finiteness of 2D lattice walks with multiplicities"
Retrieved from "http://wiki.siam.org/siag-ag/index.php/Symbolic_Combinatorics"
Views
Personal tools