Computer generation of complicated transformations and reduction formulas for multiple hypergeometric series (Q1973532)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1437191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computer generation of complicated transformations and reduction formulas for multiple hypergeometric series |
scientific article; zbMATH DE number 1437191 |
Statements
Computer generation of complicated transformations and reduction formulas for multiple hypergeometric series (English)
0 references
6 February 2001
0 references
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.
0 references
computer generation
0 references
reductionformulas
0 references
multiple hypergeometric series
0 references
Gel'fand series
0 references
Grassmannians
0 references
0.8555262088775635
0 references
0.7981789112091064
0 references
0.7802277207374573
0 references
