Invited Speakers

Titles and Abstracts

Alin Bostan
INRIA, France

Computer Algebra in the Service of Enumerative Combinatorics


Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra has been used to explore and to solve a number of difficult questions related to lattice walks. We give an overview of recent results on structural properties (e.g., algebraicity versus transcendence) and on explicit formulas for generating functions of walks in the quarter plane. In doing so, we emphasize the algorithmic nature of the methodology, especially two important paradigms: ‘guess-and-prove’ and ‘creative telescoping’.

Xiao-shan Gao
Chinese Academy of Sciences, Beijing, China

New Developments of Mathematics Mechanization


In this talk, I will give a brief review of mathematics mechanization coined by Wen-Tsun Wu and then introduce some new results on mathematics mechanization for differential and difference polynomial systems: the differential sparse resultant, the differential Chow form and Chow coordinates, and a characteristic set method for difference polynomial systems.

Nadia Heninger
University of California, San Diego, USA

Algorithmic techniques and open problems in cryptanalysis


In this talk, I will survey some families of techniques that arise in the practical cryptanalysis of public-key cryptosystems, and mention candidate improvements and open problems.