GeneratingFunctions
From MaRDI portal
Cited in
(58)- A characteristic set method for ordinary difference polynomial systems
- A Mathematica package for \(q\)-holonomic sequences and power series
- Computer-assisted proofs of special function identities related to Poisson integrals
- gfun
- qMultiSum
- SumCracker
- Computer proofs of a new family of harmonic number identities.
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II
- HolonomicFunctions
- NumGfun
- SIGMA
- DDMF
- A comparison of algorithms for proving positivity of linearly recurrent sequences
- Kazhdan-Lusztig polynomials of fan matroids, wheel matroids, and whirl matroids
- DD-finite functions in Sage
- Some structural results on \(\mathrm{D}^n\)-finite functions
- Linear differential equations as a data structure
- NesSomos
- Cfinite
- EvaluateMultiSums
- A computable extension for D-finite functions: DD-finite functions
- Arithmetic properties of Picard-Fuchs equations and holonomic recurrences
- Plane partitions. VI: Stembridge's TSPP theorem
- Effective scalar products of D-finite symmetric functions
- Telescopers
- Singular
- MultiSum
- fastZeil
- Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm
- FPS
- An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
- An algorithmic approach to the Mellin transform method
- Walks
- Guess.m
- LinearSystemSolver
- HalfLine
- OneDimWalks
- QuarterPlane
- WalkCarefully
- D-finite numbers
- ALG.txt
- dd_functions
- ore_algebra
- The complete generating function for Gessel walks is algebraic
- Holonomic relations for modular functions and forms: First guess, then prove
- On 3-dimensional lattice walks confined to the positive octant
- Truncating binomial series with symbolic summation
- RhoSum
- A Computer Proof of Moll’s Log-Concavity Conjecture
- OreSys
- MultiIntegrate
- NestedProducts
- Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra
- Computing the complexity for Schelling segregation models
- Hypergeometric summation algorithms for high-order finite elements
- Positivity of certain sums over Jacobi kernel polynomials
- Finding efficient recursions for risk aggregation by computer algebra
- On recurrences for Ising integrals
This page was built for software: GeneratingFunctions
