| |
| | [No title] (Site not responding. Last check: 2007-11-03) |
 | | A hypergeometric series $F$ depends on of two sets: parameters $A=(a_1, a_2,..., a_N)$ and variables $X=(x_1, x_2,..., x_n)$. |
 | | A classical problem: For which sets of parameters the series $F$ can be written as a series $G$ with a lesser number of parameters $B=(b_1, b_2,..., b_M)$ and variables $Y=(y_1, y_2,..., y_m)$ where elements of $B$'s are rational expressions in $a_i$'s and elements of $Y$ are rational expressions in $y_j$'s. |
 | | A series of reduction formulas was constructed in 1993 by Gelfand, Graev and Retakh as a by-product of a sophisticated geometrical machine. |
| dimacs.rutgers.edu /Events/2005/abstracts/retakh.html (176 words) |
|