SumCracker: A package for manipulating symbolic sums and related objects
From MaRDI portal
Publication:2457385
DOI10.1016/j.jsc.2006.06.005zbMath1122.68746OpenAlexW2109687233MaRDI QIDQ2457385
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2006.06.005
Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Related Items
The \(C\)-finite ansatz ⋮ Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra ⋮ Closed form solutions of linear difference equations in terms of symmetric products ⋮ Automated simplification of large symbolic expressions ⋮ Solving difference equations whose coefficients are not transcendental ⋮ Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials ⋮ Positivity of certain sums over Jacobi kernel polynomials ⋮ A Computer Proof of Moll’s Log-Concavity Conjecture ⋮ Reasoning Algebraically About P-Solvable Loops ⋮ SumCracker ⋮ How to generate as many Somos-like miracles as you wish† ⋮ A comparison of algorithms for proving positivity of linearly recurrent sequences ⋮ An efficient procedure deciding positivity for a class of holonomic functions ⋮ A hypergeometric inequality
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving difference equations whose coefficients are not transcendental
- Theory of summation in finite terms
- A holonomic systems approach to special functions identities
- \texttt{qMultiSum} -- a package for proving \(q\)-hypergeometric multiple summation identities
- An infinite family of Engel expansions of Rogers-Ramanujan type
- On the Lambert \(w\) function
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- \texttt{RRtools} -- a Maple package for aiding the discovery and proof of finite Rogers-Ramanujan type identities
- Telescoping in the context of symbolic summation in Maple
- An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
- Closed form summation of 𝐶-finite sequences
- Strong Primality Tests that are Not Sufficient
- Summation in Finite Terms
- Computer proofs for polynomial identities in arbitrary many variables
- Symbolic summation with single-nested sum extensions
- A procedure for proving special function inequalities involving a discrete parameter
- Finding telescopers with minimal depth for indefinite nested sum and product expressions
- On an inequality of P. Turán concerning Legendre polynomials
