Arithmetic and Asymptotic Properties for Some Functions Related to the Least r-Gaps of Partitions

IF 0.8 4区 数学 Q4 MATHEMATICS, APPLIED
Nayandeep Deka Baruah, Pranjal Talukdar
{"title":"Arithmetic and Asymptotic Properties for Some Functions Related to the Least r-Gaps of Partitions","authors":"Nayandeep Deka Baruah,&nbsp;Pranjal Talukdar","doi":"10.1007/s00026-025-00772-z","DOIUrl":null,"url":null,"abstract":"<div><p>The minimal excludant or mex of a partition, as introduced by Andrews and Newman [3], is the smallest positive integer missing from that partition. Recently, Ballantine and Merca [5] studied a generalization of mex called the least <i>r</i>-gap and defined as the smallest positive integer which does not appear at least <i>r</i> times in the partition. In this article, we deduce the generating functions for certain arithmetic functions related to the least <i>r</i>-gaps and establish their connections with known partition functions. We also obtain arithmetic properties and asymptotic formulae for some of these functions. As a consequence of one such result, we find an asymptotic formula for the Andrews’ singular overpartition function <span>\\({\\overline{C}}_{k,i}(n)\\)</span>.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"30 2","pages":"525 - 551"},"PeriodicalIF":0.8000,"publicationDate":"2025-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-025-00772-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

The minimal excludant or mex of a partition, as introduced by Andrews and Newman [3], is the smallest positive integer missing from that partition. Recently, Ballantine and Merca [5] studied a generalization of mex called the least r-gap and defined as the smallest positive integer which does not appear at least r times in the partition. In this article, we deduce the generating functions for certain arithmetic functions related to the least r-gaps and establish their connections with known partition functions. We also obtain arithmetic properties and asymptotic formulae for some of these functions. As a consequence of one such result, we find an asymptotic formula for the Andrews’ singular overpartition function \({\overline{C}}_{k,i}(n)\).

若干与分区最小r-间隙有关的函数的算术和渐近性质
由Andrews和Newman[3]引入的分区的最小不排除数或mex是该分区中缺失的最小正整数。最近,Ballantine和Merca[5]研究了mex的一种推广,称为最小r间隙,并将其定义为在划分中不出现至少r次的最小正整数。本文推导了与r-gap最小相关的若干算术函数的生成函数,并建立了它们与已知配分函数的联系。我们还得到了其中一些函数的算术性质和渐近公式。作为其中一个结果的结果,我们得到了Andrews奇异过配分函数\({\overline{C}}_{k,i}(n)\)的一个渐近公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Annals of Combinatorics
Annals of Combinatorics 数学-应用数学
CiteScore
1.00
自引率
0.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书