Abstract
In this work, inspired by Ramanujan’s fifth order Mock Theta function f1(q), we define acollection of functions and look at them as generating functions for partitions of some integer n containing at least m parts equal to each one of the numbers from 1 to its greatest part s, with no gaps.We set a two-line matrix representation for these partitions for any m ≥ 2 and collect the values of the sum of the entries in the second line of those matrices. These sums contain information about some parts of the partitions, which lead us to closed formulas for the number of partitions generated by our functions, and partition identities involving other simpler and well known partition functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
