Extensions of the well-poised and elliptic well-poised Bailey lemma

We establish a number of extensions of the well-poised Bailey lemma and elliptic well-poised Bailey lemma. As application we prove some new transformation formulae for basic and elliptic hyper-geometric series, and embed some recent identities of Andrews, Berkovich and Spiridonov in a well-poised Bailey tree.     

New finite Rogers-Ramanujan identities

We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson’s transformation formula by specialization or through Bailey’s method, the second similar formula can be proved either by using the first formula and the q-Gosper algorithm, or through the so-called Bailey lattice.      

Multiple elliptic hypergeometric series. An approach from the Cauchy determinant

A multiple generalization of elliptic hypergeometric series is studied through the Cauchy determinant for the Weierstrass sigma function. In particular, a duality transformation for multiple hypergeometric series is proposed. As an application, two types of Bailey transformations for very well-poised multiple elliptic hypergeometric series are derived.     

Bilateral inversions and terminating basic hypergeometric series identities

The q-analogue of Legendre inversions is established and generalized to bilateral sequences. They are employed to investigate the dual relations of three basic formulae due to Jackson and Bailey, on balanced ₃?₂-series, well-poised ₈?₇-series and bilateral ₆ψ₆-series. Several terminating well-poised series identities are consequently derived, including the q-Dixon formulae on terminating ₃ψ₃-series and two terminating well-poised ₅ψ₅-series identities due to [F.H. Jackson, Certain q-identities, Quart. J. Math. (Oxford) 12 (1941) 167-172; W.N. Bailey, On the analogue of Dixon’s theorem for bilateral basic hypergeometric series, Quart. J. Math. (Oxford) 1 (1950) 318-320].     

两个新的mock theta双重和

最近, 张和李使用一个Bailey对, 获得了五个与$q$-超几何双重和相关的mock theta 函数. 本文使用此Bailey对, 我们进一步地建立了两个新的与Appell-Lerch和及theta级数相关的mock theta双重和. 进而也获得了其中一个新的mock theta函数和经典mock theta函数之间的一些关系式.     

A Bailey Tree for Integrals

We introduce the notion of integral Bailey pairs. Using the single-variable elliptic beta integral, we construct an infinite binary tree of identities for elliptic hypergeometric integrals. Two particular sequences of identities are described explicitly.     

Families of multisums as mock theta functions

In view of the Bailey lemma and the relations between Hecke-type sums and Appell–Lerch sums given by Hickerson and Mortenson, we find that many Bailey pairs given by Slater can be used to deduce mock theta functions. Therefore, by constructing generalized Bailey pairs with more parameters, we derive some new families of mock theta functions. Meanwhile, some identities between new mock theta functions and classical ones are established. Furthermore, based on the proofs of the main theorems, many q-hypergeometric transformations are obtained.     

On identities of the Rogers-Ramanujan type

A generalized Bailey pair, which contains several special cases considered by Bailey (Proc. London Math. Soc. (2), 50, 421–435 (1949)), is derived and used to find a number of new Rogers-Ramanujan type identities. Consideration of associated q-difference equations points to a connection with a mild extension of Gordon’s combinatorial generalization of the Rogers-Ramanujan identities (Amer. J. Math., 83, 393–399 (1961)). This, in turn, allows the formulation of natural combinatorial interpretations of many of the identities in Slater’s list (Proc. London Math. Soc. (2) 54, 147–167 (1952)), as well as the new identities presented here. A list of 26 new double sum–product Rogers-Ramanujan type identities are included as an Appendix. 2000 Mathematics Subject Classification Primary—11B65; Secondary—11P81, 05A19, 39A13     

An A Bailey lemma and Rogers-Ramanujan-type identities

Using new -functions recently introduced by Hatayama et al. and by (two of) the authors, we obtain an A version of the classical Bailey lemma. We apply our result, which is distinct from the A Bailey lemma of Milne and Lilly, to derive Rogers-Ramanujan-type identities for characters of the W algebra.

     

Constructive extensions of three summation formulas for <Emphasis Type="Italic">q</Emphasis>-series and their applications to Bailey pairs

This paper is devoted to three constructive extensions associated with the Pfaff–Saalschütz \({}_3\phi _2\), Watson’s \({}_6\phi _5\), and Jackson’s \({}_8\phi _7\) summation formulas in basic hypergeometric series. All these lead to new general recurrence approaches to well-known Bailey pairs and well-poised Bailey pairs, as well as the emergence of new Pfaff–Saalschütz pairs. Some new applications to q-series are also investigated.     

普通型Bailey引理和 Riordan链

本文主要研究在超几何函数和Ramanujan-Rogers类型恒等式有非常重要作用的.Beilay引理和Riordan链的关系,证明了普通型Bailey引理本质上是一个特殊Riordan群的Riordan链.     

Identities of the Rogers-Ramanujan-Bailey type

A multiparameter generalization of the Bailey pair is defined in such a way as to include as special cases all Bailey pairs considered by W.N. Bailey in his paper [Identities of the Rogers-Ramanujan type, Proc. London Math. Soc. (2) 50 (1949) 421-435]. This leads to the derivation of a number of elegant new Rogers-Ramanujan type identities.     

Comparison of a branch-and-bound heuristic,a newsvendor-based heuristic and periodic Bailey rules for outpatients appointment scheduling systems

Appointment-based service systems admit limited number of customers at a specific time interval to make service providers more accessible by reducing customers’ waiting time and make the costly resources more productive. A traditional approach suggests the Bailey rule, which assigns one or more customers at the initial block and only one customer at remaining blocks. We prescribe two heuristic approaches and variations of the traditional Bailey rule to appointment scheduling systems with the objective of minimizing total expected costs of delay and idle times between blocks. The first heuristic adopts a branch-and-bound approach using forward dynamic programming and tries to fully enumerate with some restrictions. The second heuristic uses a sequential-inverse newsvendor approach using a starting solution. We conduct numerical tests, which show that both heuristics get near-optimal solutions in a quicker time than a commercial solver, CPLEX and that the second approach gives near-optimal solutions far faster than the first approach. In addition, we suggest the use of a periodic Bailey rule, which can be implemented easily in practice, and provides a close solution to the best result of both heuristics, depending upon cost parameters and service-time variances.     

拉格朗日反演的q模拟与Bailey引理的注记

本文主要揭示了Gessel Ira.等给出的拉格朗日反演的q—模拟形式与An-drews G.E.的Bailey引理之间的相互转化的联系,做为例证,给出了利用这些关系得到的古典超几何级数(hypergeometric series)变换和求和公式的新证明,同时得到了模5、7、9、27四个新的Roger’s-Ramanujan类型的恒等式,其具有十分重要的组合意义。     

Constructible sets of linear differential equations and effective rational approximations of polylogarithmic functions

The aim of this paper is to investigate rational approximations to solutions of some linear Fuchsian differential equations from the perspective of moduli of linear differential equations with fixed monodromy group. One of the main arithmetic applications concerns the study of linear forms involving polylogarithmic functions. In particular, we give an explanation of the well-poised hypergeometric origin of Rivoal’s construction on linear forms involving odd zeta values.     

q-Hypergeometric Series and Macdonald Functions

We derive a duality formula for two-row Macdonald functions by studying their relation with basic hypergeometric functions. We introduce two parameter vertex operators to construct a family of symmetric functions generalizing Hall-Littlewood functions. Their relation with Macdonald functions is governed by a very well-poised q-hypergeometric functions of type ₄₃, for which we obtain linear transformation formulas in terms of the Jacobi theta function and the q-Gamma function. The transformation formulas are then used to give the duality formula and a new formula for two-row Macdonald functions in terms of the vertex operators. The Jack polynomials are also treated accordingly.     

J-inner matrix functions, interpolation and inverse problems for canonical systems, III: More on the inverse monodromy problem

This paper is a continuation of our study of the inverse monodromy problem for canonical systems of integral and differential equations which appeared in a recent issue of this journal. That paper established a parametrization of the set of all solutions to the inverse monodromy for canonical integral systems in terms of two continuous chains of matrix valued inner functions in the special case that the monodromy matrix was strongly regular (and the signature matrixJ was not definite). The correspondence between the chains and the solutions of this monodromy problem is one to one and onto. In this paper we study the solutions of this inverse problem for several different classes of chains which are specified by imposing assorted growth conditions and symmetries on the monodromy matrix and/or the matrizant (i.e., the fundamental solution) of the underlying equation. These external conditions serve to either fix or limit the class of admissible chains without computing them explicitly. This is useful because typically the chains are not easily accessible.     

TheC ℓ Bailey transform and Bailey lemma

TheC _? nonterminating C_? summation theorem is derived by appropriately specializing Gustafson's₆ψ₆ summation theorem for bilateral basic hypergeometric series very well-poised on symplecticC _? groups. From this, the terminating₆?₅ and, hence, terminating₄?₃ summation theorem is obtained. A suitably modified₄?₃ is then used to derive theC _? generalization of the Bailey transform. The transform is then interpreted as a matrix inversion result for two infinite, lower-triangular matrices. This result is used to motivate the definition of theC _? Bailey pair. TheC _? generalization of Bailey's lemma is then proved. This result is inverted, and the concept of the bilateral Bailey chain is discussed. TheC _? Bailey lemma is then used to obtain a connection coefficient result for generalC _? littleq-Jacobi polynomials. All of this work is a natural extension of the unitaryA _?, or equivalentlyU(?+1), case. The classical case, corresponding toA ₁ or equivalentlyU(2), contains an immense amount of the theory and application of one-variable basic hypergeometric series, including elegant proofs of the Rogers-Ramanujan-Schur identities. TheC _? nonterminating₆?₅ summation theorem is also used to recover C. Krattenthaler's multivariable summation which he utilized in deriving his refinement of the Bender-Knuth and MacMahon generating functions for certain sets of plane partitions.     

Abel’s lemma on summation by parts and partial <Emphasis Type="Italic">q</Emphasis>-series transformations

The partial sums of basic hypergeometric series are investigated by means of the modified Abel lemma on summation by parts. Several transformation and summation formulae for well-poised, quadratic, cubic and quartic q-series are established. This work was partially supported by National Natural Science Foundation for the Youth (Grant No. 10801026)     

The Saalschütz chain reactions and bilateral basic hypergeometric series

By iterating recursively the q-Saalschütz summation formula, we introduce the Saalschütz chain reactions. A general series transform, which expresses a nonterminating bilateral series in terms of a finite multiple unilateral sum, will be established. As applications we derive, by means of Bailey’s 6ψ6 -series identity, several bilateral transformations including one due to Milne [12]. These transformations further yield a number of closed formulas of very well-poised bilateral basic hypergeometric series; which are closely related to the identities obtained by Minton [13], Karlsson [11], Gasper [8], and Chu [5], [6], [7] through the partial fraction method and divided differences.