gfun
From MaRDI portal
Gfun
Cited in
(only showing first 100 items - show all)- Truncating binomial series with symbolic summation
- A noncommutative algebraic operational calculus for boundary problems
- Non-redundant random generation algorithms for weighted context-free grammars
- Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra
- An exact solution of three interacting friendly walks in the bulk
- scientific article; zbMATH DE number 718854 (Why is no real title available?)
- On the robustness of interconnections in random graphs: a symbolic approach.
- Effective scalar products of D-finite symmetric functions
- Self-avoiding walks, the language of science, and Fibonacci numbers
- Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality
- Permutations avoiding sets of patterns with long monotone subsequences
- Motzkin numbers of higher rank: Generating function and explicit expression
- Guessing singular dependencies
- scientific article; zbMATH DE number 1263296 (Why is no real title available?)
- Controlled non-uniform random generation of decomposable structures
- Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions
- Note on algebraic solutions of differential equations with known finite Galois group
- Finding efficient recursions for risk aggregation by computer algebra
- The number of intervals in the \(m\)-Tamari lattices
- A computable extension for D-finite functions: DD-finite functions
- Case Studies in Model Manipulation for Scientific Computing
- Extended rate, more GFUN
- The complete generating function for Gessel walks is algebraic
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- Effective computation of rational approximants and interpolants
- Transforming problems from analysis to algebra: a case study in linear boundary problems
- Identities for families of orthogonal polynomials and special functions
- Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order
- A multi-computational exploration of some games of pure chance
- On the enumeration of closures and environments with an application to random generation
- scientific article; zbMATH DE number 1253974 (Why is no real title available?)
- 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
- Coxeter-bicatalan combinatorics
- Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial
- On 3-dimensional lattice walks confined to the positive octant
- Solving mathematical problems using knowledge-based systems
- Lattice paths: Vicious walkers and friendly walkers
- Computer proofs of a new family of harmonic number identities.
- scientific article; zbMATH DE number 1522340 (Why is no real title available?)
- Orthogonal polynomials and computer algebra
- Advanced determinant calculus
- Khovanskii bases of Cox-Nagata rings and tropical geometry
- Pattern statistics in faro words and permutations
- Computing the complexity for Schelling segregation models
- The computational challenge of enumerating high-dimensional rook walks
- CoG-PETS: code generation for parameter estimation in time series
- scientific article; zbMATH DE number 5286863 (Why is no real title available?)
- Computation and applications of Mathieu functions: a historical perspective
- An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
- scientific article; zbMATH DE number 1996428 (Why is no real title available?)
- Generalisations of the Harer-Zagier recursion for 1-point functions
- Plane partitions. VI: Stembridge's TSPP theorem
- Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
- Random subgroups of Thompson's group \(F\).
- Shift equivalence of P-finite sequences
- On a class of languages with holonomic generating functions
- Symbolic conversion of holonomic functions to hypergeometric type power series
- Motif statistics.
- Relax, but don't be too lazy
- Bounds for D-finite closure properties
- Analytic combinatorics of non-crossing configurations
- Summations in Bernoulli's triangles via generating functions
- Computer algebra libraries for combinatorial structures
- scientific article; zbMATH DE number 1253996 (Why is no real title available?)
- Graphical enumeration and stained glass windows. I: Rectangular grids
- On the square root of a Bell matrix
- On the number of planar Eulerian orientations
- On the expected number of perfect matchings in cubic planar graphs
- Basic analytic combinatorics of directed lattice paths
- A polynomial parametrization of torus knots
- ACETAF
- HYPERG
- Maple
- qMultiSum
- qZeil
- RComp
- SumCracker
- HYP
- Mgfun
- HolonomicFunctions
- NumGfun
- ECPP
- SIGMA
- OEIS
- coxeter
- posets
- SF
- D-modules
- DDMF
- ESF
- Asyrec
- hgm R
- GenRGenS
- Guess
This page was built for software: gfun
