gfun

swMATH344MaRDI QIDQ13105FDOQ13105

Author name not available (Why is that?)

Described by source

• GFUN

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

• Effective scalar products of D-finite symmetric functions
• On the robustness of interconnections in random graphs: a symbolic approach.
• Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality
• Permutations avoiding sets of patterns with long monotone subsequences
• Guessing singular dependencies
• Title not available (Why is that?)
• Note on algebraic solutions of differential equations with known finite Galois group
• Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions
• Case Studies in Model Manipulation for Scientific Computing
• A computable extension for D-finite functions: DD-finite functions
• Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order
• On the enumeration of closures and environments with an application to random generation
• A multi-computational exploration of some games of pure chance
• D-finite numbers
• Enumeration of three-dimensional convex polygons
• Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform
• Coxeter-bicatalan combinatorics
• Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Computer Algebra, Power Series and Summation
• Solving mathematical problems using knowledge-based systems
• Khovanskii bases of Cox-Nagata rings and tropical geometry
• Pattern statistics in faro words and permutations
• Title not available (Why is that?)
• An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
• Title not available (Why is that?)
• Computation of Tight Enclosures for Laplacian Eigenvalues
• Generalisations of the Harer-Zagier recursion for 1-point functions
• Shift equivalence of P-finite sequences
• Symbolic conversion of holonomic functions to hypergeometric type power series
• Bounds for D-finite closure properties
• Title not available (Why is that?)
• On the number of planar Eulerian orientations
• On the square root of a Bell matrix
• Title not available (Why is that?)
• The Dynamic Dictionary of Mathematical Functions (DDMF)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Skew Dyck paths having no peaks at level 1
• Orthogonal Polynomials and Computer Algebra
• Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite
• Title not available (Why is that?)
• A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method
• The Holonomic Toolkit
• Title not available (Why is that?)
• Factorization of fourth-order differential equations for perturbed classical orthogonal polynomials.
• An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths
• Some structural results on \(\mathrm{D}^n\)-finite functions
• 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
• Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids
• Computing approximate greatest common right divisors of differential polynomials
• A direct decomposition of 3-connected planar graphs
• Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity
• DD-finite functions in Sage
• Deepest nodes in marked ordered trees
• On Hadamard square roots of unity
• Software for the algorithmic work with orthogonal polynomials and special functions
• Decomposition of polynomials with respect to the cyclic group of order \(m\)
• Two Dimensional Directed Lattice Walks with Boundaries
• Computation and Applications of Mathieu Functions: A Historical Perspective
• On Fourth-order Difference Equations for Orthogonal Polynomials of a Discrete Variable: Derivation, Factorization and Solutions
• An exact solution of three interacting friendly walks in the bulk
• A noncommutative algebraic operational calculus for boundary problems
• Title not available (Why is that?)
• 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
• 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
• The complete generating function for Gessel walks is algebraic
• Effective computation of rational approximants and interpolants
• Extended rate, more GFUN
• Identities for families of orthogonal polynomials and special functions
• Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
• Transforming problems from analysis to algebra: a case study in linear boundary problems
• Title not available (Why is that?)
• Ore Polynomials in Sage
• Uniform random generation of decomposable structures using floating-point arithmetic
• Explicit formulas for enumeration of lattice paths: basketball and the kernel method
• Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases
• Title not available (Why is that?)
• On 3-dimensional lattice walks confined to the positive octant
• Lattice paths: Vicious walkers and friendly walkers
• Computer proofs of a new family of harmonic number identities.
• Advanced determinant calculus
• Title not available (Why is that?)
• Computing the complexity for Schelling segregation models
• The computational challenge of enumerating high-dimensional rook walks
• Plane partitions. VI: Stembridge's TSPP theorem
• Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
• Title not available (Why is that?)
• Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra
• Random subgroups of Thompson's group \(F\).
• On a class of languages with holonomic generating functions
• Motif statistics.
• Relax, but don't be too lazy

This page was built for software: gfun