gfun

swMATH344MaRDI QIDQ13105

No author found.

Described by source

• GFUN

Related Items (only showing first 100 items - show all)

Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality ⋮ Solving mathematical problems using knowledge-based systems ⋮ Binomial identities -- combinatorial and algorithmic aspects ⋮ A polynomial parametrization of torus knots ⋮ Symbolic conversion of holonomic functions to hypergeometric type power series ⋮ Lattice paths: Vicious walkers and friendly walkers ⋮ D-finite numbers ⋮ Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases ⋮ An exact solution of three interacting friendly walks in the bulk ⋮ Hypergeometric summation algorithms for high-order finite elements ⋮ Multiple binomial sums ⋮ A direct decomposition of 3-connected planar graphs ⋮ Shift equivalence of P-finite sequences ⋮ On the number of planar Eulerian orientations ⋮ Efficient random sampling of binary and unary-binary trees via holonomic equations ⋮ Computer algebra libraries for combinatorial structures ⋮ Self-avoiding walks, the language of science, and Fibonacci numbers ⋮ On the number of descendants and ascendants in random search trees ⋮ An algorithm for deciding zero equivalence of nested polynomially recurrent sequences ⋮ On the functions counting walks with small steps in the quarter plane ⋮ Non-redundant random generation algorithms for weighted context-free grammars ⋮ Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra ⋮ Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity ⋮ A computable extension for D-finite functions: DD-finite functions ⋮ Transforming problems from analysis to algebra: a case study in linear boundary problems ⋮ Guessing singular dependencies ⋮ Computer proofs of a new family of harmonic number identities. ⋮ Unnamed Item ⋮ Factorization of fourth-order differential equations for perturbed classical orthogonal polynomials. ⋮ Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs ⋮ Refined holonomic summation algorithms in particle physics ⋮ Permutations sortable by two stacks in parallel and quarter plane walks ⋮ Decomposition of polynomials with respect to the cyclic group of order \(m\) ⋮ HYPERG: a Maple package for manipulating hypergeometric series ⋮ Computer Algebra, Power Series and Summation ⋮ A multi-computational exploration of some games of pure chance ⋮ The number of intervals in the \(m\)-Tamari lattices ⋮ Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy ⋮ On triangulations with high vertex degree ⋮ The Tu-Deng conjecture holds almost surely ⋮ On the positivity of the Gillis-Reznick-Zeilberger rational function ⋮ Constructible differentially finite algebraic series in several variables ⋮ The enumeration of permutations with a prescribed number of ``forbidden patterns ⋮ On 3-dimensional lattice walks confined to the positive octant ⋮ Coxeter-bicatalan combinatorics ⋮ Finding efficient recursions for risk aggregation by computer algebra ⋮ Khovanskii bases of Cox-Nagata rings and tropical geometry ⋮ A noncommutative algebraic operational calculus for boundary problems ⋮ Plane partitions. VI: Stembridge's TSPP theorem ⋮ Extended rate, more GFUN ⋮ Controlled non-uniform random generation of decomposable structures ⋮ Pseudo-factorials, elliptic functions, and continued fractions ⋮ Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra ⋮ Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite ⋮ Counting colored planar maps: algebraicity results ⋮ Computing the complexity for Schelling segregation models ⋮ Generalisations of the Harer-Zagier recursion for 1-point functions ⋮ The computational challenge of enumerating high-dimensional rook walks ⋮ Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields ⋮ Effective bounds for P-recursive sequences ⋮ Pattern statistics in faro words and permutations ⋮ On a class of languages with holonomic generating functions ⋮ On the square root of a Bell matrix ⋮ Computing the algebraic relations of \(C\)-finite sequences and multisequences ⋮ Ore Polynomials in Sage ⋮ A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method ⋮ Algorithmic approach for formal Fourier series ⋮ Non-commutative elimination in Ore algebras proves multivariate identities ⋮ DD-finite functions in Sage ⋮ Some structural results on \(\mathrm{D}^n\)-finite functions ⋮ On asymptotic extrapolation ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ The polynomial method for random matrices ⋮ On Hadamard square roots of unity ⋮ Software for the algorithmic work with orthogonal polynomials and special functions ⋮ A Mathematica package for \(q\)-holonomic sequences and power series ⋮ On the expected number of perfect matchings in cubic planar graphs ⋮ Advanced determinant calculus ⋮ Uniform random generation of decomposable structures using floating-point arithmetic ⋮ Deepest nodes in marked ordered trees ⋮ Periodic Pólya urns, the density method and asymptotics of Young tableaux ⋮ Enumeration of three-dimensional convex polygons ⋮ Explicit formulas for enumeration of lattice paths: basketball and the kernel method ⋮ 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 ⋮ Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets ⋮ Effective scalar products of D-finite symmetric functions ⋮ A Sumudu based algorithm for solving differential equations ⋮ Random subgroups of Thompson's group \(F\). ⋮ Analytic combinatorics of non-crossing configurations ⋮ Note on algebraic solutions of differential equations with known finite Galois group ⋮ Asymptotic analysis of an optimized quicksort algorithm. ⋮ On the robustness of interconnections in random graphs: a symbolic approach. ⋮ Motif statistics. ⋮ Permutations avoiding sets of patterns with long monotone subsequences ⋮ Unnamed Item ⋮ Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions ⋮ Basic analytic combinatorics of directed lattice paths ⋮ Computing the Generating Function of a Series Given Its First Few Terms ⋮ Relax, but don't be too lazy

This page was built for software: gfun