当前位置:
X-MOL 学术
›
Int. J. Number Theory
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Combinatorial proof of the minimal excludant theorem
International Journal of Number Theory ( IF 0.7 ) Pub Date : 2021-02-26 , DOI: 10.1142/s1793042121500615 Cristina Ballantine 1 , Mircea Merca 2
International Journal of Number Theory ( IF 0.7 ) Pub Date : 2021-02-26 , DOI: 10.1142/s1793042121500615 Cristina Ballantine 1 , Mircea Merca 2
Affiliation
The minimal excludant of a partition λ , mex ( λ ) , is the smallest positive integer that is not a part of λ . For a positive integer n , σ mex ( n ) denotes the sum of the minimal excludants of all partitions of n . Recently, Andrews and Newman obtained a new combinatorial interpretation for σ mex ( n ) . They showed, using generating functions, that σ mex ( n ) equals the number of partitions of n into distinct parts using two colors. In this paper, we provide a purely combinatorial proof of this result and new properties of the function σ mex ( n ) . We generalize this combinatorial interpretation to σ r mex ( n ) , the sum of least r -gaps in all partitions of n . The least r -gap of a partition λ is the smallest positive integer that does not appear at least r times as a part of λ .
中文翻译:
最小排除定理的组合证明
分区的最小排除项λ ,墨西哥 ( λ ) , 是不属于λ . 对于一个正整数n ,σ 墨西哥 ( n ) 表示所有分区的最小排除项之和n . 最近,安德鲁斯和纽曼获得了新的组合解释σ 墨西哥 ( n ) . 他们使用生成函数表明,σ 墨西哥 ( n ) 等于的分区数n 使用两种颜色分成不同的部分。在本文中,我们提供了该结果的纯组合证明和函数的新属性σ 墨西哥 ( n ) . 我们将这种组合解释推广到σ r 墨西哥 ( n ) , 最小的总和r -所有分区中的间隙n . 至少r - 分区间隙λ 是至少不出现的最小正整数r 次作为的一部分λ .
更新日期:2021-02-26
中文翻译:
最小排除定理的组合证明
分区的最小排除项