The complexity of generating functions for integer points in polyhedra and beyond

Autores: Alexander Barvinok
Localización: Proceedings oh the International Congress of Mathematicians: Madrid, August 22-30,2006 : invited lectures / coord. por Marta Sanz Solé , Javier Soria de Diego , Juan Luis Varona Malumbres , Joan Verdera , Vol. 3, 2006, ISBN 978-3-03719-022-7, págs. 763-788
Idioma: inglés
Enlaces
- Texto completo (pdf)
Resumen
- Motivated by the formula for the sum of the geometric series, we consider various classes of sets S �¼ Zd of integer points for which an a priori �glong�h Laurent series or polynomial m�¸S xm can be written as a �gshort�h rational function f (S; x). Examples include the sets of integer points in rational polyhedra, integer semigroups, and Hilbert bases of rational cones, among others. We discuss applications to efficient counting and optimization and open questions.