The following pages link to GFUN (Q4371576):
Displaying 50 items.
- gfun (Q13105) (← links)
- Multiple binomial sums (Q346550) (← links)
- Non-redundant random generation algorithms for weighted context-free grammars (Q391421) (← links)
- Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra (Q394759) (← links)
- Transforming problems from analysis to algebra: a case study in linear boundary problems (Q413404) (← links)
- Permutations sortable by two stacks in parallel and quarter plane walks (Q458593) (← links)
- On 3-dimensional lattice walks confined to the positive octant (Q505688) (← links)
- Extended rate, more GFUN (Q548596) (← links)
- The Tu-Deng conjecture holds almost surely (Q668088) (← links)
- On the positivity of the Gillis-Reznick-Zeilberger rational function (Q670644) (← links)
- Constructible differentially finite algebraic series in several variables (Q672982) (← links)
- Controlled non-uniform random generation of decomposable structures (Q708203) (← 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)
- On a class of languages with holonomic generating functions (Q728269) (← links)
- Algorithmic approach for formal Fourier series (Q748752) (← links)
- Periodic Pólya urns, the density method and asymptotics of Young tableaux (Q782409) (← links)
- A polynomial parametrization of torus knots (Q843947) (← links)
- The number of guillotine partitions in \(d\) dimensions (Q844186) (← links)
- Hypergeometric summation algorithms for high-order finite elements (Q858177) (← links)
- A quantitative study of pure parallel processes (Q907263) (← links)
- Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy (Q938112) (← links)
- Finding efficient recursions for risk aggregation by computer algebra (Q953412) (← links)
- Effective bounds for P-recursive sequences (Q992808) (← links)
- On asymptotic extrapolation (Q1023265) (← links)
- The polynomial method for random matrices (Q1029549) (← links)
- A Mathematica package for \(q\)-holonomic sequences and power series (Q1037558) (← links)
- Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294) (← links)
- Enumeration of three-dimensional convex polygons (Q1293442) (← links)
- Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets (Q1296754) (← links)
- Analytic combinatorics of non-crossing configurations (Q1300975) (← links)
- Lattice paths: Vicious walkers and friendly walkers (Q1347970) (← links)
- Computer proofs of a new family of harmonic number identities. (Q1415382) (← links)
- Factorization of fourth-order differential equations for perturbed classical orthogonal polynomials. (Q1421234) (← links)
- On Hadamard square roots of unity (Q1566743) (← links)
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II (Q1580673) (← links)
- Basic analytic combinatorics of directed lattice paths (Q1603684) (← links)
- Coxeter-bicatalan combinatorics (Q1745385) (← links)
- Asymptotic analysis of an optimized quicksort algorithm. (Q1853184) (← links)
- 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)
- Self-avoiding walks, the language of science, and Fibonacci numbers (Q1923411) (← links)
- Decomposition of polynomials with respect to the cyclic group of order \(m\) (Q1971735) (← 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)
