The following pages link to gfun (Q13105):
Displaying 50 items.
- On the robustness of interconnections in random graphs: a symbolic approach. (Q1853495) (← links)
- Motif statistics. (Q1853502) (← links)
- Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions (Q1860383) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- Solving mathematical problems using knowledge-based systems (Q1887832) (← links)
- Computer algebra libraries for combinatorial structures (Q1918485) (← links)
- Self-avoiding walks, the language of science, and Fibonacci numbers (Q1923411) (← links)
- On the functions counting walks with small steps in the quarter plane (Q1927932) (← links)
- Decomposition of polynomials with respect to the cyclic group of order \(m\) (Q1971735) (← links)
- HYPERG: a Maple package for manipulating hypergeometric series (Q1972217) (← links)
- Generalisations of the Harer-Zagier recursion for 1-point functions (Q2025126) (← links)
- Pattern statistics in faro words and permutations (Q2032888) (← links)
- On the square root of a Bell matrix (Q2038381) (← links)
- A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method (Q2051589) (← links)
- On the expected number of perfect matchings in cubic planar graphs (Q2075311) (← links)
- Deepest nodes in marked ordered trees (Q2081358) (← links)
- Permutations avoiding sets of patterns with long monotone subsequences (Q2100048) (← links)
- Symbolic conversion of holonomic functions to hypergeometric type power series (Q2142982) (← links)
- Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity (Q2188990) (← links)
- A multi-computational exploration of some games of pure chance (Q2229699) (← links)
- A noncommutative algebraic operational calculus for boundary problems (Q2254066) (← links)
- Pseudo-factorials, elliptic functions, and continued fractions (Q2270201) (← links)
- Counting colored planar maps: algebraicity results (Q2275895) (← links)
- DD-finite functions in Sage (Q2306447) (← links)
- Some structural results on \(\mathrm{D}^n\)-finite functions (Q2307438) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- Explicit formulas for enumeration of lattice paths: basketball and the kernel method (Q2328846) (← links)
- Linear differential equations as a data structure (Q2329042) (← links)
- Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality (Q2369904) (← links)
- On the number of planar Eulerian orientations (Q2400972) (← links)
- Efficient random sampling of binary and unary-binary trees via holonomic equations (Q2402673) (← links)
- A computable extension for D-finite functions: DD-finite functions (Q2422706) (← links)
- Guessing singular dependencies (Q2437325) (← links)
- Plane partitions. VI: Stembridge's TSPP theorem (Q2483909) (← links)
- Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite (Q2500616) (← links)
- Computing the algebraic relations of \(C\)-finite sequences and multisequences (Q2517807) (← links)
- Effective scalar products of D-finite symmetric functions (Q2568968) (← links)
- Note on algebraic solutions of differential equations with known finite Galois group (Q2573794) (← links)
- A direct decomposition of 3-connected planar graphs (Q2654584) (← links)
- Fraction-free computation of matrix rational interpolants and matrix GCDs (Q2706245) (← links)
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields (Q2792368) (← links)
- Ore Polynomials in Sage (Q2808008) (← links)
- Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases (Q2912125) (← links)
- An algorithm for deciding zero equivalence of nested polynomially recurrent sequences (Q2944555) (← links)
- Summations in Bernoulli's triangles via generating functions (Q2953129) (← links)
- (Q3077262) (← links)
- Computing the Generating Function of a Series Given Its First Few Terms (Q3142989) (← links)
- D-finite numbers (Q3177689) (← links)
- An exact solution of three interacting friendly walks in the bulk (Q3186555) (← links)
- Computer Algebra, Power Series and Summation (Q3298072) (← links)
