A Note on the Trinomial Analogue of Bailey's Lemma
β Scribed by S.Ole Warnaar
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 315 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
Recently, Andrews and Berkovich introduced a trinomial version of Bailey's lemma. In this note we show that each ordinary Bailey pair gives rise to a trinomial Bailey pair. This largely widens the applicability of the trinomial Bailey lemma and proves some of the identities proposed by Andrews and Berkovich.
1998 Academic Press
In a recent paper, Andrews and Berkovich (AB) proposed a trinomial analogue of Bailey's lemma [3]. As a starting point AB took the following definitions of the q-trinomial coefficients:
π SIMILAR VOLUMES
## Abstract The aim of this note is to point out that the boundary condition for the network modelling of thermal problems may have been incorrectly used in some previous studies. It is shown that the accuracy of the network analogue or the equivalent finiteβdifference method is on the par with the
If G is a finite, directed, simple and irreducible graph, deletion of an edge makes the entropy decrease. We give a proof of this fact that avoids the Perron-Frobenius theorem and makes use of a technique developed by Gromov.
It is an important problem to determine when a complete noncompact Riemannian manifold admits a positive Green's function. In this regard, one tries to seek geometric assumptions which are stable with respect to uniform perturbations of the metric. In this note, we obtained some results in this dire