A NOTE ON A BIJECTIVE PROOF OF A THEOREM OF G. E. ANDREWS

Print ISSN: 2319-1023 | Online ISSN: 2582-5461

Abstract

In this paper we provide a bijective proof for the theorem 3.1 of Andrews [6]. This theorem involves the number of semi-Fibonacci partitions and the number of binary partitions in which each part appears an odd number of times.

Keywords and Phrases

Integer Partitions, Semi-Fibonacci, Binary Partitions, Bijective Proof, Partition Identities.

A.M.S. subject classification

05A17, 11P82, 11P84.

.....

Download PDF Click here to Subscribe now