Predicting Zero Coefficients in Formal Power Series Computations

K. Kalorkoti

Research output: Contribution to journalArticlepeer-review


We consider the problem of predicting long sequences of zero coefficients in a power series obtained by multiplication, division or reversion (where all coefficients are integers). We describe efficient randomized algorithms whose probability of error can be controlled by the user. A runtime analysis is given and some experimental results are also presented that compare our algorithms with classical ones for formal power series computations. We envisage the algorithms given here as being of greatest use in situations where several processors are available so that the possibility of a long sequence of zeros can be tested in parallel to the normal computation of coefficients.
Original languageEnglish
Pages (from-to)307-320
Number of pages14
JournalJournal of Symbolic Computation
Issue number3
Publication statusPublished - Mar 2002


Dive into the research topics of 'Predicting Zero Coefficients in Formal Power Series Computations'. Together they form a unique fingerprint.

Cite this