Session S24 - Symbolic Computation: Theory, Algorithms and Applications

Tuesday, July 13, 17:30 ~ 17:55 UTC-3

On positivity of holonomic sequences

Veronika Pillwein

RISC, Joh. Kepler Univ. Linz, Austria   -   This email address is being protected from spambots. You need JavaScript enabled to view it.

Holonomic sequences are very well-behaved obects: they satisfy linear recurrences with polynomial coefficients and together with sufficiently many initial values, this gives an exact and finite representation. Over the past decades, several algorithms have been developed and implemented to automatically derive and prove identitities on holonomic sequences. Proving inequalities involving such expressions can not yet be done in such a systematic automatized way. Still, there are some recent methods and structural results for inequalities on holonomic sequences. In this talk, we give an overview on some of these results and show some successful applications of existing software.

View abstract PDF