Advances in Computer Algebra

This book discusses the latest advances in algorithms for symbolic summation, factorization, symbolic-numeric linear algebra and linear functional equations. It presents a collection of papers on original research topics from the Waterloo Workshop on Computer Algebra (WWCA-2016), a satellite workshop of the International Symposium on Symbolic and Algebraic Computation (ISSAC'2016), which was held at Wilfrid Laurier University (Waterloo, Ontario, Canada) on July 23-24, 2016. This workshop and the resulting book celebrate the 70th birthday of Sergei Abramov (Dorodnicyn Computing Centre of the Russian Academy of Sciences, Moscow), whose highly regarded and inspirational contributions to symbolic methods have become a crucial benchmark of computer algebra and have been broadly adopted by many Computer Algebra systems.

Inhalt
Asymptotic Log-convexity

Manuel Kauers, Johannes Kepler University, Austria

Doron Zeilberger, Rutgers University, USA

Factorization of C-finite Sequences

Christoph Koutschan, RICAM, Austria

Inverse Inequality Estimates with Symbolic Computation

Ziming Li, Chinese Academy of Sciences, China

Johannes Middeke, RISC, Johannes Kepler University Linz, Austria Denominator Bounds for Higher Order Recurrence Systems Mark Round, Johannes Kepler University Linz, Austria

Trading field extensions and recurrence order through refined holonomic summation

Evans Doe Ocansey, RISC, Johannes Kepler University Linz, Austria

Representation of (q)-hypergeometric products and mixed versions in difference rings Carsten Schneider, RISC, Johannes Kepler University Linz, Austria

Characterizations of R-extensions

Eric Schost, University of Waterloo, Canada

Lifting techniques for Hermite-Pad´e approximants

Vo Ngoc Thieu, RISC, Johannes Kepler University Linz, Austria

An Algorithm For Computing Rational General Solutions of First-order Algebraic ODEs

Eugene Zima, WLU, Canada Linear time minimization of summable part in Abramov's algorithms for rational summation