gfun

swMATH344MaRDI QIDQ13105FDOQ13105

Author name not available (Why is that?)

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
• 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
• Analytic combinatorics of non-crossing configurations
• Computer algebra libraries for combinatorial structures
• On the expected number of perfect matchings in cubic planar graphs
• Basic analytic combinatorics of directed lattice paths
• Title not available (Why is that?)
• Rational and algebraic series in combinatorial enumeration
• A polynomial parametrization of torus knots
• Algorithmic approach for formal Fourier series
• Hypergeometric summation algorithms for high-order finite elements
• Title not available (Why is that?)
• Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets
• Title not available (Why is that?)
• Permutations sortable by two stacks in parallel and quarter plane walks
• On the functions counting walks with small steps in the quarter plane
• On asymptotic extrapolation
• Non-commutative elimination in Ore algebras proves multivariate identities
• Title not available (Why is that?)
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Binomial identities -- combinatorial and algorithmic aspects
• Multiple binomial sums
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Asymptotic analysis of an optimized quicksort algorithm.
• Computing the Generating Function of a Series Given Its First Few Terms
• On triangulations with high vertex degree
• A Mathematica package for \(q\)-holonomic sequences and power series
• Title not available (Why is that?)
• A Proof of a Recurrence for Bessel Moments
• STACS 2005
• The polynomial method for random matrices
• Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy
• Pseudo-factorials, elliptic functions, and continued fractions
• Effective bounds for P-recursive sequences
• Efficient random sampling of binary and unary-binary trees via holonomic equations
• 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
• HYPERG: a Maple package for manipulating hypergeometric series
• Counting colored planar maps: algebraicity results
• Refined holonomic summation algorithms in particle physics
• On the number of descendants and ascendants in random search trees
• A Sumudu based algorithm for solving differential equations
• Title not available (Why is that?)
• Constructible differentially finite algebraic series in several variables
• 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

This page was built for software: gfun