Mimar Sinan Fine Arts University Mathematics Department Seminars

Polyhedral Omega: A new linear Diophantine system solver
Zafeirakis Zaferakopuoulos
Galatasaray University, Turkey
Özet : Polyhedral Omega is a new algorithm for solving linear Diophantine systems (LDS), i.e., for computing a multivariate rational function representation of the set of all non-negative integer solutions to a system of linear equations and inequalities. Polyhedral Omega combines methods from partition analysis with methods from polyhedral geometry. In particular, we combine MacMahon’s iterative approach based on the Omega operator and explicit formulas for its evaluation with geometric tools such as Brion decomposition and Barvinok’s short rational function representations. In this way, we connect two branches of research that have so far remained separate, unified by the concept of symbolic cones which we introduce. The resulting LDS solver Polyhedral Omega is significantly faster than previous solvers based on partition analysis and it is competitive with state-of-the-art LDS solvers based on geometric methods. Most importantly, this synthesis of ideas makes Polyhedral Omega by far the simplest algorithm for solving linear Diophantine systems available to date. This is joint work with Felix Breuer.
  Tarih : 22.10.2015
  Saat : 16:00
  Yer : 106, Bomonti campus
  Dil : English
    Yazdır