Computer generation of complicated transformations and reduction formulas for multiple hypergeometric series

From MaRDI portal
(Redirected from Publication:1973532)





A theoretical foundation underlying the computer program for a universal transformation formulae governing multiple hypergeometric series as well as an algorithmic criterion for finding reducible cases are presented. As an illustration, new reduction formulae for Gel'fand series in 3 and 4 variables connected with the Grassmannians \(G_{2,4}\) and \(G_{3,6}\), respectively, are derived.











This page was built for publication: Computer generation of complicated transformations and reduction formulas for multiple hypergeometric series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1973532)