Examples for the algorithmic calculation of formal Puisieux, Laurent and power series

@article{Koepf1993ExamplesFT,
  title={Examples for the algorithmic calculation of formal Puisieux, Laurent and power series},
  author={Wolfram Koepf},
  journal={ACM SIGSAM Bulletin},
  year={1993},
  volume={27},
  pages={20-32}
}
Formal Laurent-Puisieux series (LPS) of the form [EQUATION] are important in calculus and complex analysis. In some Computer Algebra Systems (CASs) it is possible to define an LPS by direct or recursive definition of its coefficients. Since some operations cannot be directly supported within the LPS domain, some systems generally convert LPS to finite truncated LPS for operations such as addition, multiplication, division, inversion and formal substitution. This results in a substantial loss of… CONTINUE READING