SumCracker
From MaRDI portal
Software:13668
No author found.
Related Items (17)
The \(C\)-finite ansatz ⋮ Unnamed Item ⋮ An algorithm for deciding zero equivalence of nested polynomially recurrent sequences ⋮ Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra ⋮ Invariant Generation for P-Solvable Loops with Assignments ⋮ Closed form solutions of linear difference equations in terms of symmetric products ⋮ Automated simplification of large symbolic expressions ⋮ Sparsity optimized high order finite element functions for H(div) on simplices ⋮ 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 ⋮ An extension of Turán's inequality ⋮ A Computer Proof of Moll’s Log-Concavity Conjecture ⋮ On Turán's inequality for Legendre polynomials ⋮ 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
This page was built for software: SumCracker
