04103 Leipzig
Germany E1 05 (Leibniz-Saal)
Solving hard polynomial systems
Solving systems of polynomial equations is a challenging and ubiquitous problem in pure and applied mathematics. Algorithmic techniques for solving polynomial systems have been successfully employed to tackle problems from diverse areas such as biology, physics, and robotics. State-of-the-art algorithms are based on symbolic techniques, such as Gröbner bases, numerical methods, such as homotopy continuation, or use a mixed approach. This workshop has the aim to give hands on experience in applying these techniques and methods to explicit problems. Concretely, participants will spend the majority of the time at the workshop working in groups on specific questions to which techniques in polynomial system solving can be applied. These questions will be supplied by dedicated group leaders at the beginning of the workshop.
For some of the problem solving sessions it might be useful to have installed the newest version of the programming language Julia beforehand. It can be found at the official webpage: julialang.org/downloads/.