The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations
From MaRDI portal
Publication:2385106
DOI10.1007/s00026-007-0317-yzbMath1125.05009OpenAlexW2152354623MaRDI QIDQ2385106
Publication date: 11 October 2007
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-007-0317-y
Exact enumeration problems, generating functions (05A15) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Related Items (max. 100)
Inverse inequality estimates with symbolic computation ⋮ Advanced computer algebra for determinants ⋮ Hardinian arrays ⋮ Binomial determinants for tiling problems yield to the holonomic ansatz ⋮ Proof of George Andrews’s and David Robbins’s q -TSPP conjecture ⋮ A curious family of binomial determinants that count rhombus tilings of a holey hexagon ⋮ Some determinants of path generating functions ⋮ Creative Telescoping for Holonomic Functions
Uses Software
This page was built for publication: The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations