Computer Algebra: Gröbner Bases for Combinatorics Part 1

Description

This course is intended as an invitation to computer algebra. We will begin with a crash course in Gröbner basis theory, including classical applications such as implicitization and elimination. We will continue by investigating how Gröbner bases can be useful in various concrete combinatorial applications such as colorings of graphs, the Frobenius coin problem, restricted lattice walks, and polytopes. We will close by discussing Gröbner basis for operators. Part 1: Background, polynomial rings and term orderings.

Period	08 Sept 2016
Event title	ALEA in Europe Young Researcher's Workshop
Event type	Conference
Location	AustriaShow on map