DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11488
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEyyunni, Pramod-
dc.date.accessioned2023-08-18T03:44:20Z-
dc.date.available2023-08-18T03:44:20Z-
dc.date.issued2021-05-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0097316521000224-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11488-
dc.description.abstractWe obtain a finite analogue of a recent generalization of an identity in Ramanujan's Notebooks. Differentiating it with respect to one of the parameters leads to a result whose limiting case gives a finite analogue of Andrews' famous identity for . The latter motivates us to extend the theory of the restricted partition function , namely, the number of partitions of n with largest parts less than or equal to N, by obtaining the finite analogues of rank and crank for vector partitions as well as of the rank and crank moments. As an application of the identity for our finite analogue of the spt-function, namely , we prove an inequality between the finite second rank and crank moments. The other results obtained include finite analogues of a recent identity of Garvan, an identity relating and , namely the finite analogues of the divisor and largest parts functions respectively, and a finite analogue of the Beck-Chern theorem.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectMathematicsen_US
dc.subjectPartitionsen_US
dc.subjectRestricted partition functionen_US
dc.subjectq-seriesen_US
dc.subjectFinite analoguesen_US
dc.subjectSmallest parts functionen_US
dc.subjectDivisor functionen_US
dc.titleUntrodden pathways in the theory of the restricted partition function p(n,N)en_US
dc.typeArticleen_US
Appears in Collections:Department of Mathematics

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.