zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Multiple series Rogers-Ramanujan type identities. (English) Zbl 0547.10012
This is the author’s first formal treatment of ”Bailey chains”, a technique for discovering and proving q-series identities which has proven to be very powerful. A ”Bailey pair” is a pair of sequences $(\{\alpha\sb r\},\{\beta\sb n\})$ satisfying $$ (*)\quad\beta\sb n=\sum\alpha\sb r/(1-q)...(1-q\sp{n-r})(1-aq)...(1-aq\sp{n+r}),\quad 0\le r\le n. $$ {\it W. N. Bailey} [Proc. Lond. Math. Soc., II. Ser. 49, 421- 435 (1947; Zbl 0041.034)] showed that any q-series identity which defines a Bailey pair can be transformed into a new identity. It is the author’s observation that each Bailey pair in fact lies inside a doubly infinite sequence of Bailey pairs, any one of which implies the others. Thus any identity of the form of (*) gives rise to a doubly infinite family of identities. For example, the 130 identities of {\it L. J. Slater} [ibid. 54, 147-167 (1952; Zbl 0046.272)] become 130 distinct infinite families of identities. More usefully, given a conjectured identity of type (*), it is possible to move up or down in the Bailey chain in hopes of finding an equivalent Bailey pair for which the identity is easier to prove. This is essentially what L. J. Rogers did to prove the Rogers-Ramanujan identities.
Reviewer: D.M.Bressoud

11P81Elementary theory of partitions
05A19Combinatorial identities, bijective combinatorics
Full Text: DOI