𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalisations of the Andrews-Olsson partition identity and applications

✍ Scribed by Christine Bessenrodt

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
523 KB
Volume
141
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In (Bessenrodt, 1991) a combinatorial proof of a refinement of the Andrews-Olsson partition identity (Andrews and Olsson, 1991) was given. In this article we explore the methods of (Bessenrodt, 1991) further to deal also with partitions where repetitions are allowed and where the restrictions on the congruence set are omitted. We obtain a considerable generalisation of the earlier results, again giving bijective proofs of the partition identities in question. As an application, it is then shown how to deduce (refinements of) some old results by Sylvester and Schur as well as some recent results by Alladi and Gordon [1].

πŸ“œ SIMILAR VOLUMES

Generalisations of the pitzerβ€”gwinn and
Generalisations of the pitzerβ€”gwinn and feynmanβ€”hibbs approximations for quantum partition functions
✍ Antoine Royer πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 280 KB

By using an exprwmn of Feynman and Hibbs for Ihe panirion funchon Z = Tr(exp[ -fl( p'/2n1+ I')]) in lerrns of imegnls over paths wilh tixed means, and substituting for the potenlial Y a local harmonic approxl-L (following Mdler). ~c obtain nn improved Pluer-Gwinn approximation\_ as simple to use as