Application of Unspecified Sequences in Symbolic Summation

Manuel Kauers; Carsten Schneider

Application of Unspecified Sequences in Symbolic Summation

Research Institute for Symbolic Computation

Research output: Working paper and reports › Research report

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
Place of Publication	Johannes Kepler University, Altenberger Str. 69, 4040 Linz
Publisher	SFB
Number of pages	8
Publication status	Published - Dec 2005

Publication series

Name	SFB F013 Reports
No.	2005-19

Fields of science

101 Mathematics
101001 Algebra
101005 Computer algebra
101009 Geometry
101012 Combinatorics
101013 Mathematical logic
101020 Technical mathematics

Cite this

@techreport{55b98bc7aedb45a3bb1390908ad4dd31,

title = "Application of Unspecified Sequences in Symbolic Summation",

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.",

author = "Manuel Kauers and Carsten Schneider",

year = "2005",

month = dec,

language = "English",

series = "SFB F013 Reports",

publisher = "SFB",

number = "2005-19",

type = "WorkingPaper",

institution = "SFB",

}

TY - UNPB

T1 - Application of Unspecified Sequences in Symbolic Summation

AU - Kauers, Manuel

AU - Schneider, Carsten

PY - 2005/12

Y1 - 2005/12

N2 - 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.

AB - 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.

M3 - Research report

T3 - SFB F013 Reports

BT - Application of Unspecified Sequences in Symbolic Summation

PB - SFB

CY - Johannes Kepler University, Altenberger Str. 69, 4040 Linz

ER -