Minimal excludant over partitions into distinct parts

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11490

Full metadata record

DC Field	Value	Language
dc.contributor.author	Eyyunni, Pramod	-
dc.date.accessioned	2023-08-18T03:49:27Z	-
dc.date.available	2023-08-18T03:49:27Z	-
dc.date.issued	2022	-
dc.identifier.uri	https://arxiv.org/pdf/2105.13875	-
dc.identifier.uri	http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11490	-
dc.description.abstract	The average size of the “smallest gap” of a partition was studied by Grabner and Knopfmacher in 2006. Recently, Andrews and Newman, motivated by the work of Fraenkel and Peled, studied the concept of the “smallest gap” under the name “minimal excludant” of a partition and rediscovered a result of Grabner and Knopfmacher. In the present paper, we study the sum of the minimal excludants over partitions into distinct parts, and interestingly we observe that it has a nice connection with Ramanujan’s function (q). As an application, we derive a stronger version of a result of Uncu.	en_US
dc.language.iso	en	en_US
dc.publisher	ARXIV	en_US
dc.subject	Mathematics	en_US
dc.title	Minimal excludant over partitions into distinct parts	en_US
dc.type	Article	en_US
Appears in Collections:	Department of Mathematics

Files in This Item:

There are no files associated with this item.