Symbolic Combinatorics
From SIAG-AG
(Difference between revisions)
| Revision as of 11:33, 24 November 2014 (edit) Blekherman (Talk | contribs) (→'''Organizer''') ← Previous diff |
Current revision (11:45, 24 November 2014) (edit) (undo) Blekherman (Talk | contribs) |
||
| (One intermediate revision not shown.) | |||
| Line 1: | Line 1: | ||
| - | =='''Confirmed speakers'''== | + | 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) | + | * Cyril Banderier (Universite de Paris XIII), "Combinatorics and asymptotics: beyond the D-finite world" |
| - | + | * Felix Breuer (RISC, Austria) | |
| - | Yongjae Cha (RISC Linz) | + | * Shishuo Fu (Penn State) |
| - | + | * Tomack Gilmore (Universität Wien) | |
| - | Shaoshi Chen (Academy of Mathematics and Systems Science) | + | * Qinghu Hou (Nankai University) "Congruences of Truncated Hypergeometric Series and Zeilberger's Algorithm" |
| - | + | * Arthur Libo Yang (Nankai University) | |
| - | Stavros Garoufalidis (Georgia Institute of Technology) | + | * Eric Rowland (University of Liège) "Computing congruences for combinatorial sequences" |
| - | + | * Rika Yatchak (NC State) "D-finiteness of 2D lattice walks with multiplicities" | |
| - | Mark von Hoejj (Florida State University) | + | |
| - | + | ||
| - | Manuel Kauers (RISC Linz) | + | |
| - | + | ||
| - | Christoph Koutschan (RISC Linz) | + | |
| - | + | ||
| - | Victor Moll (Tulane University) | + | |
| - | + | ||
| - | Robin Pemantle (University of Pennsylvania) | + | |
| - | + | ||
| - | Bruno Salvy (INRIA) | + | |
Current revision
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"
