The following pages link to GeneratingFunctions (Q26177):
Displayed 29 items.
- On 3-dimensional lattice walks confined to the positive octant (Q505688) (← links)
- Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra (Q711793) (← links)
- Computing the complexity for Schelling segregation models (Q718797) (← links)
- Hypergeometric summation algorithms for high-order finite elements (Q858177) (← links)
- Positivity of certain sums over Jacobi kernel polynomials (Q950413) (← links)
- Finding efficient recursions for risk aggregation by computer algebra (Q953412) (← links)
- On recurrences for Ising integrals (Q990763) (← links)
- A characteristic set method for ordinary difference polynomial systems (Q1006653) (← links)
- A Mathematica package for \(q\)-holonomic sequences and power series (Q1037558) (← links)
- Computer-assisted proofs of special function identities related to Poisson integrals (Q1037567) (← links)
- Computer proofs of a new family of harmonic number identities. (Q1415382) (← links)
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II (Q1580673) (← links)
- A comparison of algorithms for proving positivity of linearly recurrent sequences (Q2109988) (← links)
- Kazhdan-Lusztig polynomials of fan matroids, wheel matroids, and whirl matroids (Q2169826) (← links)
- DD-finite functions in Sage (Q2306447) (← links)
- Some structural results on \(\mathrm{D}^n\)-finite functions (Q2307438) (← links)
- Linear differential equations as a data structure (Q2329042) (← links)
- A computable extension for D-finite functions: DD-finite functions (Q2422706) (← links)
- Arithmetic properties of Picard-Fuchs equations and holonomic recurrences (Q2445010) (← links)
- Plane partitions. VI: Stembridge's TSPP theorem (Q2483909) (← links)
- Effective scalar products of D-finite symmetric functions (Q2568968) (← links)
- Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm (Q2628258) (← links)
- An algorithm for deciding zero equivalence of nested polynomially recurrent sequences (Q2944555) (← links)
- (Q3062302) (← links)
- D-finite numbers (Q3177689) (← links)
- The complete generating function for Gessel walks is algebraic (Q4929975) (← links)
- Holonomic relations for modular functions and forms: First guess, then prove (Q4991703) (← links)
- (Q5298135) (← links)
- A Computer Proof of Moll’s Log-Concavity Conjecture (Q5423939) (← links)