Monday, September 28, 2015 - 3:05pm
1 hour (actually 50 minutes)
In numerical algebraic geometry the key idea is to solve systems of polynomial equations via homotopy continuation. By this is meant, that the solutions of a system are tracked as the coefficients change continuously toward the system of interest. We study the tropicalisation of this process. Namely, we combinatorially keep track of the solutions of a tropical polynomial system as its coefficients change. Tropicalising the entire regeneration process of numerical algebraic geometry, we obtain a combinatorial algorithm for finding all tropical solutions. In particular, we obtain the mixed cells of the system in a mixed volume computation. Experiments suggest that the method is not only competitive but also asymptotically performs better than conventional methods for mixed cell enumeration. The method shares many of the properties of a recent tropical method proposed by Malajovich. However, using symbolic perturbations, reverse search and exact arithmetic our method becomes reliable, memory-less and well-suited for parallelisation.