Workshop on
"Computer Algebra in Combinatorics"
November 13  17, 2017
Schedule
Speakers:

Sergei Abramov (Russian Academy of Sciences, Moscow, Russia):
On the arithmetic and shift
complexities of inversion of difference operator matrices

Moulay Barkatou (CNRS, Université de Limoges, France):
Algorithms for removing apparent singularities of linear differential systems

Alin Bostan (INRIA, Saclay, France):
Computer algebra for lattice
path combinatorics
Part 1, Part 2.

David Broadhurst (Open University, Milton Keynes, United Kingdom):
Applications of
integer relation algorithms

Frédéric Chyzak (INRIA Saclay, France):
Computing solutions of linear Mahler equations

Philippe Di Francesco (University of Illinois at UrbanaChampaign, USA):
Arctic curves in path models from the tangent method

Mark Giesbrecht (University of Waterloo, Canada):
Quasideterminants, degree bounds and "fast" algorithms for matrices of
differential and difference polynomials

Maximilian Jaroschek (Technische Universität Wien, Austria):
How not to define desingularization

Christoph Koutschan (Johann Radon Institute for Computational and Applied Mathematics, Linz, Austria):
Symbolic evaluation of determinants and rhombus tilings of holey hexagons

George Labahn (University of Waterloo, Canada):
TBA

Stephen Melczer (University of Pennsylvania, Philadelphia, USA):
Multivariate singularity analysis and hyperplane arrangements

Marc Mezzarobba (Université Pierre et Marie Curie, Paris, France):
Numerical evaluation of Dfinite functions in SageMath with
applications

Robin Pemantle (University of Pennsylvania, Philadelphia, USA):
Automatic computation of multivariate asymptotics

Marko Petkovsek (Univerza v Ljubljani, Ljubljana, Slovenia):
Convolutions as solutions of linear recurrences

Georg Regensburger (Johannes Kepler Universität Linz, Austria):
Consequences of the fundamental theorem of calculus in differential
rings (demo)

Tanguy Rivoal (CNRS, Université Grenoble Alpes):
Algorithmic determination of exceptional algebraic values of
Efunctions

Tom Roby (University of Connecticut, USA):
A path formula for birational rowmotion on a product of two chains

Dan Romik (University of California at Davis, USA):
The Taylor expansion of the Jacobi theta function at x=1

Bruno Salvy (École Normale et Supérieure Lyon, France):
Algorithmic tools for the asymptotics of diagonals

Armin Straub (University of South Alabama, USA):
Properties of Laurent coefficients of multivariate rational
functions

Mark Wilson (University of Auckland, New Zealand):
ACSV: help wanted from computer algebra(ists)
(Maple worksheet)

Guoce Xin (Capital Normal University, Beijing, China):
Some progress on the sweep maps
(PDF version)

Further speakers will be announced shortly.
Restore Frames