gfun

swMATH344MaRDI QIDQ13105FDOQ13105

Author name not available (Why is that?)

Official website: http://algo.inria.fr/libraries/papers/gfun.html

Described by source

• GFUN

Cited In (only showing first 100 items - show all)

• Non-redundant random generation algorithms for weighted context-free grammars
• Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra
• Motzkin numbers of higher rank: Generating function and explicit expression
• Self-avoiding walks, the language of science, and Fibonacci numbers
• Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality
• Title not available (Why is that?)
• Controlled non-uniform random generation of decomposable structures
• Finding efficient recursions for risk aggregation by computer algebra
• The number of intervals in the \(m\)-Tamari lattices
• Effective computation of rational approximants and interpolants
• Extended rate, more GFUN
• Transforming problems from analysis to algebra: a case study in linear boundary problems
• Title not available (Why is that?)
• D-finite numbers
• Uniform random generation of decomposable structures using floating-point arithmetic
• Enumeration of three-dimensional convex polygons
• Explicit formulas for enumeration of lattice paths: basketball and the kernel method
• Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Title not available (Why is that?)
• Computer proofs of a new family of harmonic number identities.
• Pattern statistics in faro words and permutations
• CoG-PETS: code generation for parameter estimation in time series
• Title not available (Why is that?)
• Computing the complexity for Schelling segregation models
• The computational challenge of enumerating high-dimensional rook walks
• Title not available (Why is that?)
• An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
• Plane partitions. VI: Stembridge's TSPP theorem
• Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
• Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra
• Shift equivalence of P-finite sequences
• On a class of languages with holonomic generating functions
• retode
• Computer algebra libraries for combinatorial structures
• On the expected number of perfect matchings in cubic planar graphs
• A polynomial parametrization of torus knots
• Algorithmic approach for formal Fourier series
• Title not available (Why is that?)
• Extended rate, more GFUN
• On asymptotic extrapolation
• Title not available (Why is that?)
• Factorization of fourth-order differential equations for perturbed classical orthogonal polynomials.
• Algorithms for the splitting of formal series; applications to alien differential calculus
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Computing the Generating Function of a Series Given Its First Few Terms
• The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II
• On triangulations with high vertex degree
• Title not available (Why is that?)
• Theta.jl
• A Proof of a Recurrence for Bessel Moments
• STACS 2005
• Effective bounds for P-recursive sequences
• Periodic Pólya urns, the density method and asymptotics of Young tableaux
• The Tu-Deng conjecture holds almost surely
• On the positivity of the Gillis-Reznick-Zeilberger rational function
• On the number of descendants and ascendants in random search trees
• Truncating binomial series with symbolic summation
• A Sumudu based algorithm for solving differential equations
• Constructible differentially finite algebraic series in several variables
• A noncommutative algebraic operational calculus for boundary problems
• The complete generating function for Gessel walks is algebraic
• Identities for families of orthogonal polynomials and special functions
• Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
• On 3-dimensional lattice walks confined to the positive octant
• Lattice paths: Vicious walkers and friendly walkers
• Advanced determinant calculus
• Random subgroups of Thompson's group \(F\).
• Motif statistics.
• Relax, but don't be too lazy
• Analytic combinatorics of non-crossing configurations
• Basic analytic combinatorics of directed lattice paths
• Rational and algebraic series in combinatorial enumeration
• Hypergeometric summation algorithms for high-order finite elements
• HYPERG
• Maple
• Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets
• qMultiSum
• qZeil
• Title not available (Why is that?)
• Mgfun
• HolonomicFunctions
• NumGfun
• ECPP
• SIGMA
• OEIS
• Permutations sortable by two stacks in parallel and quarter plane walks
• On the functions counting walks with small steps in the quarter plane
• coxeter
• posets
• SF
• D-modules
• DDMF
• ESF
• Asyrec
• hgm R
• GenRGenS
• Guess
• RATE
• CAOP

This page was built for software: gfun