{"title":"模拟函数与限制配分函数的递归关系","authors":"M. Rana, H. Kaur, K. Garg","doi":"10.7546/nntdm.2023.29.2.360-371","DOIUrl":null,"url":null,"abstract":"In this paper, we provide some recurrence relations connecting restricted partition functions and mock theta functions. Elementary manipulations are used including Jacobi triple product identity, Euler’s pentagonal number theorem, and Ramanujan’s theta functions for finding the recurrence relations.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2023-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Recurrence relations connecting mock theta functions and restricted partition functions\",\"authors\":\"M. Rana, H. Kaur, K. Garg\",\"doi\":\"10.7546/nntdm.2023.29.2.360-371\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we provide some recurrence relations connecting restricted partition functions and mock theta functions. Elementary manipulations are used including Jacobi triple product identity, Euler’s pentagonal number theorem, and Ramanujan’s theta functions for finding the recurrence relations.\",\"PeriodicalId\":44060,\"journal\":{\"name\":\"Notes on Number Theory and Discrete Mathematics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Notes on Number Theory and Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7546/nntdm.2023.29.2.360-371\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Notes on Number Theory and Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7546/nntdm.2023.29.2.360-371","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Recurrence relations connecting mock theta functions and restricted partition functions
In this paper, we provide some recurrence relations connecting restricted partition functions and mock theta functions. Elementary manipulations are used including Jacobi triple product identity, Euler’s pentagonal number theorem, and Ramanujan’s theta functions for finding the recurrence relations.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
