Abstract
We consider symbolic sums which contain subexpressions that represent unspecified sequences. Existing symbolic summation technology is extended to sums of this kind. We show how this can be applied in the systematic search for general summation identities. Both, results about the non-existence of identities of a certain form, and examples of general families of identities which we have discovered automatically are included in the paper.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of ISSAC'06 |
| Editors | Jean-Guillaume Dumas |
| Publisher | ACM Press |
| Pages | 177-183 |
| Number of pages | 7 |
| Publication status | Published - 2006 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics