Almost partition identities

Author:

Andrews George E.,Ballantine Cristina

Abstract

An almost partition identity is an identity for partition numbers that is true asymptotically100%of the time and fails infinitely often. We prove a kind of almost partition identity, namely that the number of parts in all self-conjugate partitions of n is almost always equal to the number of partitions of n in which no odd part is repeated and there is exactly one even part (possibly repeated). Not only does the identity fail infinitely often, but also, the error grows without bound. In addition, we prove several identities involving the number of parts in restricted partitions. We show that the difference in the number of parts in all self-conjugate partitions of n and the number of parts in all partitions of n into distinct odd parts equals the number of partitions of n in which no odd part is repeated, the smallest part is odd, and there is exactly one even part (possibly repeated). We provide both analytic and combinatorial proofs of this identity.

Publisher

Proceedings of the National Academy of Sciences

Subject

Multidisciplinary

Reference15 articles.

1. Partition identities;Andrews;Adv Math,1972

2. Andrews GE (1976) The Theory of Partitions

3. reprinted (1998) (Cambridge Mathematical Library, Cambridge Univ Press, Cambridge, UK), p 255.

4. Euler’s partition identity and two problems of George Beck;Andrews;Math Student,2017

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Rooted partitions and number-theoretic functions;The Ramanujan Journal;2024-01-30

2. Mock Theta Functions and Related Combinatorics;Association for Women in Mathematics Series;2024

3. Hook length and symplectic content in partitions;Journal of Combinatorial Theory, Series A;2023-11

4. Combinatorial identities associated with a bivariate generating function for overpartition pairs;Advances in Applied Mathematics;2023-02

5. ON THE NUMBER OF NEARLY SELF-CONJUGATE PARTITIONS;Bulletin of the Australian Mathematical Society;2022-11-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3