Basic Hypergeometric Series and Applications by Nathan J. Fine

By Nathan J. Fine

The idea of walls, based through Euler, has led in a traditional approach to the assumption of simple hypergeometric sequence, sometimes called Eulerian sequence. those sequence have been first studied systematically through Heine, yet many early effects are attributed to Euler, Gauss, and Jacobi. at the present time, learn in $q$-hypergeometric sequence is especially energetic, and there are actually significant interactions with Lie algebras, combinatorics, detailed services, and quantity concept. besides the fact that, the idea has been constructed to such an quantity and with this type of great quantity of robust and basic effects that the topic can seem fairly daunting to the uninitiated. by way of delivering an easy method of easy hypergeometric sequence, this publication offers a great user-friendly advent to the topic. the start line is a straightforward functionality of a number of variables enjoyable a few $q$-difference equations. the writer offers an ordinary approach for utilizing those equations to acquire changes of the unique functionality. A bilateral sequence, shaped from this functionality, is summed as an unlimited product, thereby supplying a sublime and fruitful consequence which works again to Ramanujan. by way of exploiting a different case, the writer is ready to overview the coefficients of numerous sessions of countless items by way of divisor sums. He additionally touches on basic transformation idea for simple sequence in lots of variables and the elemental multinomial, that's a generalization of a finite sum. those advancements lead obviously to the mathematics domain names of partition thought, theorems of Liouville kind, and sums of squares. touch can be made with the mock theta-functions of Ramanujan, that are associated with the rank of walls. the writer provides a couple of examples of modular features with multiplicative coefficients, in addition to the beginnings of an ordinary confident method of the sector of modular equations. Requiring purely an undergraduate history in arithmetic, this booklet presents a quick access into the sector. scholars of walls, simple sequence, theta-functions, and modular equations, in addition to study mathematicians attracted to an basic method of those parts, will locate this booklet valuable and enlightening. end result of the simplicity of its procedure and its accessibility, this paintings could end up necessary as a textbook.

Show description

Read Online or Download Basic Hypergeometric Series and Applications PDF

Best mathematical analysis books

Understanding Digital Signal Processing, Second Edition

The consequences of DSP has entered each section of our lives, from making a song greeting playing cards to CD gamers and mobile phones to clinical x-ray research. with no DSP, there will be no net. in recent times, each element of engineering and technology has been encouraged by means of DSP due to the ubiquitous machine machine and available sign processing software program.

A Formal Background to Mathematics: Logic, Sets and Numbers

§1 confronted by way of the questions pointed out within the Preface i used to be brought on to jot down this booklet at the assumption average reader can have convinced features. he'll possibly be accustomed to traditional debts of yes parts of arithmetic and with many so-called mathematical statements, a few of which (the theorems) he'll comprehend (either simply because he has himself studied and digested an evidence or simply because he accepts the authority of others) to be actual, and others of which he'll recognize (by an analogous token) to be fake.

Wavelet Neural Networks With Applications in Financial Engineering, Chaos, and Classification

Via large examples and case studies, Wavelet Neural Networks provides a step by step advent to modeling, education, and forecasting utilizing wavelet networks. The acclaimed authors current a statistical version identity framework to effectively practice wavelet networks in a number of functions, in particular, delivering the mathematical and statistical framework wanted for version choice, variable choice, wavelet community development, initialization, education, forecasting and prediction, self belief durations, prediction periods, and version adequacy checking out.

Additional info for Basic Hypergeometric Series and Applications

Example text

Equating coefficients, we have pE{n) = p(n) - p{n - l 2 ) + p(n - 22) - p(n - 32) + • • • . 21) = 1 + (1 + t)q + (1 + t)q2 + • • •. Then EXAMPLE 8. 22) I I ( T = ^ ) = E « B E ( 1 + «)0W. V i>l q ' n>0 7r(n) THEOREM 2. ) &e multilinear in the kj, that is, linear in each kj separately. ) = n kj, jes where 5 is any finite subset of the positive integers. S, 3 \q + 2q +3q +-=q(l-q)-2 for j E S. ) = n(1-9,T1-Il7rfe)» - ^ ( T ^ . I ^ . - ) As an immediate corollary, we have the following theorem. PARTITIONS 40 THEOREM 3 .

J. Rogers [24] in his first memoir "On the Expansion of Some Infinite Products" and provided the foundations on which Rogers built up to the Rogers-Ramanujan identities [25]. 9), which is the case fc = r = l , s = / = 0 o f the Fundamental Lemma in [3, p. 65]. It is clear from the results in Ramanujan's "Lost" Notebook [9, 10] that he fully understood this technique also. References 1. R. P. Agarwal, On the paper "A 'lost' notebook of Ramanuj an—Partial theta Junctions" of G. E. Andrews, Adv. in Math.

1 V^ nknu2(fk t-k\ n,fc>l a a formula utilized by Carlitz [8]. Putting t = oo &s above, we get Vi [(l-^na;a)(l-^na;-a)]4 where B = 2iuj-a{l - ua)4{l ^ 1 - qn p ' - a; 2 ")" 1 . 19. Two product-series identities. 6), divided through by (1 — b){\ — t)i\ — bt)~x, replace q by qp, b by qr, t by aq9, where p is any integer greater than 2, r and s are positive integers satisfying r + s < p, (r,p) = 1, and a is a primitive fcth root of unity, a = exp(27ria/fc), (a, fc) = 1, k > 1. 2) Y^ pmn+rm+snan m,n>0 _ V"^ pmn-rm-sn^-n _ V^ m,n>0 AT>0 A(N)qN TWO PRODUCT-SERIES IDENTITIES where E A(N) = a — pN-\-rs=(pm+s)(pn+r) ra,n>0 23 E pN+rs=(pm — s)(pn—r) m,n>0 The sums run over all factorizations of M — pN + rs into d6, where d = r, 8 = s (modp) in the first sum, d = —r, 6 = -s (modp) in the second.

Download PDF sample

Rated 4.91 of 5 – based on 23 votes