.png){kind=icon}
.png){kind=icon}
Return
Almost partition identities
.png){kind=icon}
OA
AI
DOI：10.1073/pnas.1820945116.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An almost partition identity is an identity for partition numbers that is true asymptotically 100 % 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.
Keywords:
partitions
identities
asymptotics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
9.1
Papers:
10.8W
Citations:
73.5W