English

Algorithm for computing semi-Fourier sequences of expressions involving exponentiations and integrations

Symbolic Computation 2017-02-24 v1

Abstract

We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials (expressions made of additions and multiplications).

Keywords

Cite

@article{arxiv.1702.07060,
  title  = {Algorithm for computing semi-Fourier sequences of expressions involving exponentiations and integrations},
  author = {Hoon Hong and Adam Strzebonski},
  journal= {arXiv preprint arXiv:1702.07060},
  year   = {2017}
}

Comments

20 pages

R2 v1 2026-06-22T18:26:00.776Z