The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates

From MaRDI portal
Publication:621894

DOI10.1007/978-3-7091-0445-3zbMath1225.00001OpenAlexW4243410516MaRDI QIDQ621894

Manuel Kauers, Paule, Peter

Publication date: 31 January 2011

Published in: Texts \& Monographs in Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-7091-0445-3




Related Items (82)

Synthesis with asymptotic resource boundsRecursive sequences attached to modular representations of finite groupsThe \(C\)-finite ansatzThe resultant, the discriminant, and the derivative of generalized Fibonacci polynomialsAutomated counting of restricted Motzkin pathsSymbolic conversion of holonomic functions to hypergeometric type power seriesD-finite numbersWeighted \(L^2\)-norms of Gegenbauer polynomialsDiscovering and Proving Infinite Pochhammer Sum IdentitiesEnumerating solutions to grid-based puzzles with a fixed number of rowsSome open problems related to creative telescopingIterated binomial sums and their associated iterated integralsWalks with small steps in the 4D-orthantLaguerre-Freud equations for Generalized Hahn polynomials of type IReduction-based creative telescoping for Fuchsian D-finite functionsFormal Laurent series in several variablesHypergeometric structures in Feynman integralsHermite Reduction for D-finite Functions via Integral BasesBoolean cumulants and subordination in free probabilityApproximation of differential operators with boundary conditionsEnumeration of words that contain the pattern 123 exactly onceLonely points in simplicesTruncated Hermite polynomialsOrder bounds for C2-finite sequencesFrom Polynomial Invariants to Linear LoopsThe Membership Problem for Hypergeometric Sequences with Quadratic ParametersA Jentzsch-theorem for Kapteyn, Neumann and general Dirichlet seriesOn the representability of sequences as constant termsInterview with Peter PauleA computable extension for D-finite functions: DD-finite functionsGame of pure chance with restricted boundaryTrading order for degree in creative telescopingOn the \(p\)-adic properties of \(2\)-sected sums involving binomial coefficientsThe probabilistic termination tool amberSolving invariant generation for unsolvable loopsPolynomial reduction for holonomic sequences and applications in \(\pi\)-series and congruencesAn explanation of Mellin's 1921 paperA unified approach to derive explicit solutions of generalized second-order linear recurrences and applicationsRemoving apparent singularities of linear difference systemsEnumeration of labelled 4-regular planar graphs. II: AsymptoticsUnnamed ItemUnnamed ItemUnnamed ItemAutomatic Generation of Moment-Based Invariants for Prob-Solvable LoopsA multi-computational exploration of some games of pure chanceA difference ring theory for symbolic summationAutomated termination analysis of polynomial probabilistic programsTermination of polynomial loopsRenormalization of non-singlet quark operator matrix elements for off-forward hard scatteringAlgebra-based synthesis of loops and their invariants (invited paper)Properties of powers of functions satisfying second-order linear differential equations with applications to statisticsBinomial determinants for tiling problems yield to the holonomic ansatzOn Invariance Properties of Entries of Matrix PowersOrthogonal PolynomialsGeneralisations of the Harer-Zagier recursion for 1-point functionsUsing nonlinear difference equations to study Quicksort algorithmsAnalytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automataEntropy of tropical holonomic sequencesAsymptotic enumeration of compacted binary trees of bounded right heightThe binomial transform of p-recursive sequences and the dilogarithm functionWhen the Search for Solutions Can Be TerminatedLarge Scale Analytic Calculations in Quantum Field TheoriesUntying the Gordian Knot via Experimental MathematicsStam’s Identities Collection: A Case Study for Math Knowledge BasesDD-finite functions in SageInhomogeneous restricted lattice walksSome structural results on \(\mathrm{D}^n\)-finite functionsHow to generate as many Somos-like miracles as you wishHolonomic relations for modular functions and forms: First guess, then proveTruncation bounds for differentially finite seriesPeriodic Pólya urns, the density method and asymptotics of Young tableauxComputer-Assisted Proofs of Some Identities for Bessel Functions of Fractional OrderCreative Telescoping for Holonomic FunctionsRelativistic Coulomb Integrals and Zeilberger’s Holonomic Systems Approach. IAn algorithm to prove holonomic differential equations for modular formsAn extension of holonomic sequences: \(C^2\)-finite sequencesProving Two Conjectural Series for $$\zeta (7)$$ and Discovering More Series for $$\zeta (7)$$DD-Finite Functions Implemented in SageA comparison of algorithms for proving positivity of linearly recurrent sequencesOn existence and uniqueness of formal power series solutions of algebraic ordinary differential equationsUniqueness of Clifford torus with prescribed isoperimetric ratioThe SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals


Uses Software



This page was built for publication: The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates