Results 1  10
of
54
The summation package Sigma: Underlying principles and a rhombus tiling application
 Discrete Math. Theor. Comput. Sci
, 2004
"... We give an overview of how a huge class of multisum identities can be proven and discovered with the summation package Sigma implemented in the computer algebra system Mathematica. General principles of symbolic summation are discussed. We illustrate the usage of Sigma by showing how one can find an ..."
Abstract

Cited by 39 (27 self)
 Add to MetaCart
We give an overview of how a huge class of multisum identities can be proven and discovered with the summation package Sigma implemented in the computer algebra system Mathematica. General principles of symbolic summation are discussed. We illustrate the usage of Sigma by showing how one can find and prove a multisum identity that arose in the enumeration of rhombus tilings of a symmetric hexagon. Whereas this identity has been derived alternatively with the help of highly involved transformations of special functions, our tools enable to find and prove this identity completely automatically with the computer.
Solving parameterized linear difference equations in terms of indefinite nested sums and products
 J. Differ. Equations Appl
, 2002
"... The described algorithms enable one to find all solutions of parameterized linear difference equations within ΠΣfields, a very general class of difference fields. These algorithms can be applied to a very general class of multisums, for instance, for proving identities and simplifying expressions. ..."
Abstract

Cited by 37 (24 self)
 Add to MetaCart
The described algorithms enable one to find all solutions of parameterized linear difference equations within ΠΣfields, a very general class of difference fields. These algorithms can be applied to a very general class of multisums, for instance, for proving identities and simplifying expressions. Keywords: symbolic summation, difference fields, ΠΣextensions, ΠΣfields AMS Subject Classification: 33FXX, 68W30, 12H10 1
A collection of denominator bounds to solve parameterized linear difference equations in ΠΣextensions
 Proc. SYNASC04, 6th Internat. Symposium on Symbolic and Numeric Algorithms for Scientific Computation
, 2004
"... Abstract. An important application of solving parameterized linear difference equations in ΠΣfields, a very general class of difference fields, is simplifying of multisum expressions and proving of multisum identities. This article provides essential algorithmic building blocks that allow one to ..."
Abstract

Cited by 31 (17 self)
 Add to MetaCart
Abstract. An important application of solving parameterized linear difference equations in ΠΣfields, a very general class of difference fields, is simplifying of multisum expressions and proving of multisum identities. This article provides essential algorithmic building blocks that allow one to search for all solutions of such difference equations. More precisely, these algorithms enable one to exploit a denominator elimination strategy which amounts to look for solutions in a polynomial ring instead of searching for rational function solutions.
HolonomicFunctions (User’s Guide
, 2010
"... This manual describes the functionality of the Mathematica package HolonomicFunctions. It is a very powerful tool for the work with special functions, it can assist in solving summation and integration problems, it can automatically prove special function identities, and much more. The package has b ..."
Abstract

Cited by 23 (13 self)
 Add to MetaCart
This manual describes the functionality of the Mathematica package HolonomicFunctions. It is a very powerful tool for the work with special functions, it can assist in solving summation and integration problems, it can automatically prove special function identities, and much more. The package has been developed in the frame of the PhD thesis [8]. The whole theory and the algorithms are described there, and it contains also many references for further reading as well as some more advanced examples; the examples in this manual are mostly of a very simple nature in order to illustrate clearly the use of the software. HolonomicFunctions is freely available from the RISC combinatorics software webpage www.risc.unilinz.ac.at/research/combinat/software/HolonomicFunctions/ Short references Annihilator [ expr, ops] computes annihilating operators for the expression expr with respect to the Ore operators ops (p. 5). AnnihilatorDimension [ ann] gives the dimension of the annihilating left ideal
Degree bounds to find polynomial solutions of parameterized linear difference equations in ΠΣfields
 Appl. Algebra Engrg. Comm. Comput
"... An important application of solving parameterized linear difference equations in ΠΣfields, a very general class of difference fields, is simplifying and proving of nested multisum expressions and identities. Together with other reduction techniques described elsewhere, the algorithms considered in ..."
Abstract

Cited by 22 (15 self)
 Add to MetaCart
An important application of solving parameterized linear difference equations in ΠΣfields, a very general class of difference fields, is simplifying and proving of nested multisum expressions and identities. Together with other reduction techniques described elsewhere, the algorithms considered in this article can be used to search for all solutions of such difference equations. More precisely, within a typical reduction step one often is faced with subproblems to find all solutions of linear difference equations where the solutions live in a polynomial ring. The algorithms under consideration deliver degree bounds for these polynomial solutions. 1.
A new Sigma approach to multisummation
 the Dave Robbins memorial issue of Advances in Applied Math
, 2005
"... Abstract. We present a general algorithmic framework that allows not only to deal with summation problems over summands being rational expressions in indefinite nested sums and products (Karr 1981), but also over ∂finite and holonomic summand expressions that are given by a linear recurrence. This ..."
Abstract

Cited by 17 (12 self)
 Add to MetaCart
Abstract. We present a general algorithmic framework that allows not only to deal with summation problems over summands being rational expressions in indefinite nested sums and products (Karr 1981), but also over ∂finite and holonomic summand expressions that are given by a linear recurrence. This approach implies new computer algebra tools implemented in Sigma to solve multisummation problems efficiently. For instance, the extended Sigma package has been applied successively to provide a computerassisted proof of Stembridge’s TSPP theorem. 1.
SYMBOLIC SUMMATION ASSISTS COMBINATORICS
 SÉMINAIRE LOTHARINGIEN DE COMBINATOIRE 56 (2007), ARTICLE B56B
, 2007
"... We present symbolic summation tools in the context of difference fields that help scientists in practical problem solving. Throughout this article we present multisum examples which are related to combinatorial problems. ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
We present symbolic summation tools in the context of difference fields that help scientists in practical problem solving. Throughout this article we present multisum examples which are related to combinatorial problems.
Polynomial and rational solutions of holonomic systems
 n o 12
"... Polynomial and rational solutions for linear ordinary differential equations can be obtained by algorithmic methods. For instance, the maple package DEtools provides efficient functions polysols and ratsols to find polynomial and rational ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Polynomial and rational solutions for linear ordinary differential equations can be obtained by algorithmic methods. For instance, the maple package DEtools provides efficient functions polysols and ratsols to find polynomial and rational
A refined difference field theory for symbolic summation
 Journal of Symbolic Computation
, 2008
"... In this article we present a refined summation theory based on Karr’s difference field approach. The resulting algorithms find sum representations with optimal nested depth. For instance, the algorithms have been applied successively to evaluate Feynman integrals from Perturbative Quantum Field Theo ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
In this article we present a refined summation theory based on Karr’s difference field approach. The resulting algorithms find sum representations with optimal nested depth. For instance, the algorithms have been applied successively to evaluate Feynman integrals from Perturbative Quantum Field Theory. Key words: Symbolic summation, difference fields, nested depth
A fast approach to creative telescoping
 Mathematics in Computer Science
, 2010
"... Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differentialdifference operator algebras. Our approach is based on an ansatz that explicitly includes the denominators of the delta parts. We contribute several ideas of how to make an implementation of ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differentialdifference operator algebras. Our approach is based on an ansatz that explicitly includes the denominators of the delta parts. We contribute several ideas of how to make an implementation of this approach reasonably fast and provide such an implementation. A selection of examples shows that it can be superior to existing methods by a large factor.