SumCracker
From MaRDI portal
Cited in
(27)- recpf
- SimplifySum
- A comparison of algorithms for proving positivity of linearly recurrent sequences
- TILINGS
- Cfinite
- The \(C\)-finite ansatz
- Closed form solutions of linear difference equations in terms of symmetric products
- Automated simplification of large symbolic expressions
- Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials
- A hypergeometric inequality
- GeneratingFunctions
- MultiSum
- fastZeil
- Dependencies
- An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
- Invariant Generation for P-Solvable Loops with Assignments
- Computer algebra for special function inequalities
- Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra
- CFSum
- Sparsity optimized high order finite element functions for H(div) on simplices
- An extension of Turán's inequality
- An efficient procedure deciding positivity for a class of holonomic functions
- A Computer Proof of Moll’s Log-Concavity Conjecture
- RatDiff
- Solving difference equations whose coefficients are not transcendental
- Positivity of certain sums over Jacobi kernel polynomials
- On Turán's inequality for Legendre polynomials
This page was built for software: SumCracker
