GFUN
From MaRDI portal
Publication:4371576
Recommendations
Cited in
(only showing first 100 items - show all)- On asymptotic extrapolation
- The polynomial method for random matrices
- A Mathematica package for \(q\)-holonomic sequences and power series
- Uniform random generation of decomposable structures using floating-point arithmetic
- Enumeration of three-dimensional convex polygons
- Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets
- Analytic combinatorics of non-crossing configurations
- gfun
- Lattice paths: Vicious walkers and friendly walkers
- Computer proofs of a new family of harmonic number identities.
- Factorization of fourth-order differential equations for perturbed classical orthogonal polynomials.
- On Hadamard square roots of unity
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II
- Basic analytic combinatorics of directed lattice paths
- Coxeter-bicatalan combinatorics
- Asymptotic analysis of an optimized quicksort algorithm.
- On the robustness of interconnections in random graphs: a symbolic approach.
- Motif statistics.
- Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions
- Relax, but don't be too lazy
- Solving mathematical problems using knowledge-based systems
- RComp: A \textit{Mathematica} package for computing with recursive sequences
- Self-avoiding walks, the language of science, and Fibonacci numbers
- Decomposition of polynomials with respect to the cyclic group of order \(m\)
- Generalisations of the Harer-Zagier recursion for 1-point functions
- Pattern statistics in faro words and permutations
- On the square root of a Bell matrix
- A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method
- On the expected number of perfect matchings in cubic planar graphs
- Deepest nodes in marked ordered trees
- Permutations avoiding sets of patterns with long monotone subsequences
- Symbolic conversion of holonomic functions to hypergeometric type power series
- Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity
- A multi-computational exploration of some games of pure chance
- A noncommutative algebraic operational calculus for boundary problems
- Pseudo-factorials, elliptic functions, and continued fractions
- Counting colored planar maps: algebraicity results
- DD-finite functions in Sage
- Some structural results on \(\mathrm{D}^n\)-finite functions
- Computing approximate greatest common right divisors of differential polynomials
- Linear differential equations as a data structure
- Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality
- On the number of planar Eulerian orientations
- Efficient random sampling of binary and unary-binary trees via holonomic equations
- A computable extension for D-finite functions: DD-finite functions
- Guessing singular dependencies
- Plane partitions. VI: Stembridge's TSPP theorem
- Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- Effective scalar products of D-finite symmetric functions
- Note on algebraic solutions of differential equations with known finite Galois group
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- NumGfun: a package for numerical and analytic computation with D-finite functions
- Generating functions of Chebyshev-like polynomials
- Random k-noncrossing RNA structures
- Computing the Generating Function of a Series Given Its First Few Terms
- D-finite numbers
- Computer algebra, power series and summation
- Orthogonal polynomials and computer algebra
- Continued fractions for special functions in maple
- Graphical enumeration and stained glass windows. I: Rectangular grids
- Multiple binomial sums
- Extended rate, more GFUN
- The anisotropic generating function of self-avoiding polygons is not D-finite
- Non-redundant random generation algorithms for weighted context-free grammars
- Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra
- Transforming problems from analysis to algebra: a case study in linear boundary problems
- scientific article; zbMATH DE number 516970 (Why is no real title available?)
- scientific article; zbMATH DE number 701953 (Why is no real title available?)
- Identities for families of orthogonal polynomials and special functions
- Permutations sortable by two stacks in parallel and quarter plane walks
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
- Enumerating combinatorial classes of the complex polynomial vector fields in C
- The complete generating function for Gessel walks is algebraic
- On the enumeration of closures and environments with an application to random generation
- Counting environments and closures
- DD-Finite Functions Implemented in Sage
- Skew Dyck paths having no peaks at level 1
- On 3-dimensional lattice walks confined to the positive octant
- Computation of tight enclosures for Laplacian eigenvalues
- An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths
- Computation and applications of Mathieu functions: a historical perspective
- Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order
- Properties ofq-holonomic functions
- The cogrowth series for BS(N, N) is D-finite
- Extended rate, more GFUN
- The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals
- Counting Pop-Stacked Permutations in Polynomial Time
- Cogrowth series for free products of finite groups
- Hypergeometric structures in Feynman integrals
- 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
- Some D-finite and some possibly D-finite sequences in the OEIS
- Hypergeometric-type sequences
- An Hermite-Obreshkov method for 2nd-order linear initial-value problems for ODE. With special attention paid to the Mathieu equation
- Walks avoiding a quadrant and the reflection principle
- The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
This page was built for publication: GFUN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371576)
