{"title":"Some new congruences for t-colored overpartition function","authors":"Pujashree Buragohain, Nipen Saikia","doi":"10.1007/s13370-025-01335-4","DOIUrl":null,"url":null,"abstract":"<div><p>For any positive integers <i>t</i> and <i>n</i>, let <span>\\({\\overline{D}}_t(n)\\)</span> denote the number of <i>t</i>-colored overpartitions of <i>n</i>, where each part in the partition has <i>t</i> distinct colors. In recent years, several authors established many infinite families of congruences for <span>\\({\\overline{D}}_t(n)\\)</span> by considering different values of <i>t</i>. In this paper, we prove some infinite and particular congruences for the <i>t</i>-colored overpartition function <span>\\({\\overline{D}}_t(n)\\)</span> for <span>\\(t = 2; 8m + 2; 8m + 5; 8m + 6; 16m + 2; 16m + 4\\,\\,\\textrm{and}\\,\\,32m + 4\\)</span>, where <i>m</i> is any non-negative integer.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2025-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Afrika Matematika","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s13370-025-01335-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
For any positive integers t and n, let \({\overline{D}}_t(n)\) denote the number of t-colored overpartitions of n, where each part in the partition has t distinct colors. In recent years, several authors established many infinite families of congruences for \({\overline{D}}_t(n)\) by considering different values of t. In this paper, we prove some infinite and particular congruences for the t-colored overpartition function \({\overline{D}}_t(n)\) for \(t = 2; 8m + 2; 8m + 5; 8m + 6; 16m + 2; 16m + 4\,\,\textrm{and}\,\,32m + 4\), where m is any non-negative integer.