GeneratingFunctions

From MaRDI portal
Software:26177



swMATH14273MaRDI QIDQ26177


No author found.





Related Items (29)

Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithmD-finite numbersHypergeometric summation algorithms for high-order finite elementsKazhdan-Lusztig polynomials of fan matroids, wheel matroids, and whirl matroidsAn algorithm for deciding zero equivalence of nested polynomially recurrent sequencesA computable extension for D-finite functions: DD-finite functionsUnnamed ItemComputer proofs of a new family of harmonic number identities.Arithmetic properties of Picard-Fuchs equations and holonomic recurrencesUnnamed ItemOn 3-dimensional lattice walks confined to the positive octantPositivity of certain sums over Jacobi kernel polynomialsFinding efficient recursions for risk aggregation by computer algebraPlane partitions. VI: Stembridge's TSPP theoremA Computer Proof of Moll’s Log-Concavity ConjectureThe complete generating function for Gessel walks is algebraicDetermining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebraComputing the complexity for Schelling segregation modelsOn recurrences for Ising integralsA characteristic set method for ordinary difference polynomial systemsDD-finite functions in SageSome structural results on \(\mathrm{D}^n\)-finite functionsA Mathematica package for \(q\)-holonomic sequences and power seriesComputer-assisted proofs of special function identities related to Poisson integralsHolonomic relations for modular functions and forms: First guess, then proveLinear differential equations as a data structureThe number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. IIEffective scalar products of D-finite symmetric functionsA comparison of algorithms for proving positivity of linearly recurrent sequences


This page was built for software: GeneratingFunctions