GFUN
From MaRDI portal
Publication:4371576
DOI10.1145/178365.178368zbMath0888.65010DBLPjournals/toms/SalvyZ94OpenAlexW2003189478WikidataQ60692572 ScholiaQ60692572MaRDI QIDQ4371576
Publication date: 25 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00070025/file/RT-0143.pdf
Computation of special functions and constants, construction of tables (65D20) Packaged methods for numerical algorithms (65Y15)
Related Items (only showing first 100 items - show all)
Fast Algorithms for Discrete Differential Equations ⋮ Blendstrings: an environment for computing with smooth functions ⋮ Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity ⋮ Asymptotics of some Plancherel averages via polynomiality results ⋮ Nonlinear algebra and applications ⋮ Unnamed Item ⋮ Walks avoiding a quadrant and the reflection principle ⋮ The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis ⋮ Hypergeometric-type sequences ⋮ An Hermite-Obreshkov method for 2nd-order linear initial-value problems for ODE. With special attention paid to the Mathieu equation ⋮ Holonomic equations and efficient random generation of binary trees ⋮ Solving linear difference equations with coefficients in rings with idempotent representations ⋮ Simple differentially definable functions ⋮ Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality ⋮ Solving mathematical problems using knowledge-based systems ⋮ Properties ofq-holonomic functions ⋮ A polynomial parametrization of torus knots ⋮ The number of guillotine partitions in \(d\) dimensions ⋮ Symbolic conversion of holonomic functions to hypergeometric type power series ⋮ Lattice paths: Vicious walkers and friendly walkers ⋮ D-finite numbers ⋮ On the enumeration of closures and environments with an application to random generation ⋮ Hypergeometric summation algorithms for high-order finite elements ⋮ Multiple binomial sums ⋮ On the number of planar Eulerian orientations ⋮ Efficient random sampling of binary and unary-binary trees via holonomic equations ⋮ Self-avoiding walks, the language of science, and Fibonacci numbers ⋮ Non-redundant random generation algorithms for weighted context-free grammars ⋮ Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra ⋮ Counting Pop-Stacked Permutations in Polynomial Time ⋮ Cogrowth series for free products of finite groups ⋮ Hypergeometric structures in Feynman integrals ⋮ Unnamed Item ⋮ Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity ⋮ A computable extension for D-finite functions: DD-finite functions ⋮ Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids ⋮ Transforming problems from analysis to algebra: a case study in linear boundary problems ⋮ Skew Dyck paths having no peaks at level 1 ⋮ A quantitative study of pure parallel processes ⋮ Guessing singular dependencies ⋮ Computer proofs of a new family of harmonic number identities. ⋮ Factorization of fourth-order differential equations for perturbed classical orthogonal polynomials. ⋮ Permutations sortable by two stacks in parallel and quarter plane walks ⋮ Computation of Tight Enclosures for Laplacian Eigenvalues ⋮ Identities for families of orthogonal polynomials and special functions ⋮ Decomposition of polynomials with respect to the cyclic group of order \(m\) ⋮ Computer Algebra, Power Series and Summation ⋮ Orthogonal Polynomials and Computer Algebra ⋮ A multi-computational exploration of some games of pure chance ⋮ Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy ⋮ The Tu-Deng conjecture holds almost surely ⋮ On the positivity of the Gillis-Reznick-Zeilberger rational function ⋮ Constructible differentially finite algebraic series in several variables ⋮ On 3-dimensional lattice walks confined to the positive octant ⋮ Coxeter-bicatalan combinatorics ⋮ An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths ⋮ Finding efficient recursions for risk aggregation by computer algebra ⋮ Computation and Applications of Mathieu Functions: A Historical Perspective ⋮ A noncommutative algebraic operational calculus for boundary problems ⋮ The cogrowth series for BS(N, N) is D-finite ⋮ Plane partitions. VI: Stembridge's TSPP theorem ⋮ Extended rate, more GFUN ⋮ Enumerating combinatorial classes of the complex polynomial vector fields in ℂ ⋮ The complete generating function for Gessel walks is algebraic ⋮ Controlled non-uniform random generation of decomposable structures ⋮ Pseudo-factorials, elliptic functions, and continued fractions ⋮ Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra ⋮ Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite ⋮ Counting colored planar maps: algebraicity results ⋮ Computing the complexity for Schelling segregation models ⋮ Generalisations of the Harer-Zagier recursion for 1-point functions ⋮ Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields ⋮ Effective bounds for P-recursive sequences ⋮ Pattern statistics in faro words and permutations ⋮ On a class of languages with holonomic generating functions ⋮ GENERATING FUNCTIONS OF CHEBYSHEV-LIKE POLYNOMIALS ⋮ Random k -noncrossing RNA structures ⋮ On the square root of a Bell matrix ⋮ Computing the algebraic relations of \(C\)-finite sequences and multisequences ⋮ Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm ⋮ A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method ⋮ Algorithmic approach for formal Fourier series ⋮ DD-finite functions in Sage ⋮ Some structural results on \(\mathrm{D}^n\)-finite functions ⋮ On asymptotic extrapolation ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ The polynomial method for random matrices ⋮ On Hadamard square roots of unity ⋮ The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite ⋮ A Mathematica package for \(q\)-holonomic sequences and power series ⋮ On the expected number of perfect matchings in cubic planar graphs ⋮ Uniform random generation of decomposable structures using floating-point arithmetic ⋮ Deepest nodes in marked ordered trees ⋮ Periodic Pólya urns, the density method and asymptotics of Young tableaux ⋮ Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order ⋮ Enumeration of three-dimensional convex polygons ⋮ Linear differential equations as a data structure ⋮ The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II ⋮ Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets ⋮ Effective scalar products of D-finite symmetric functions
Uses Software
This page was built for publication: GFUN
