English
Related papers

Related papers: Linked partition ideals and the Alladi--Schur theo…

200 papers

A Goellnitz-Gordon partition is one in which the parts differ by at least 2, and where the inequality is strict if a part is even. Let Q_i(n) denote the number of partitions of n into distinct parts not congruent to i mod 4. By attaching…

Combinatorics · Mathematics 2007-05-23 Krishnaswami Alladi , Alexander Berkovich

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

Number Theory · Mathematics 2024-01-09 Alfredo Nader

For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not…

Combinatorics · Mathematics 2022-07-26 Isaac Konan

In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…

Number Theory · Mathematics 2021-08-31 Abdulaziz M. Alanazi , Darlison Nyirenda

We generalise Euler's partition theorem involving odd parts and different parts for all moduli and provide new companions to Rogers-Ramanujan- Andrews-Gordon identities related to this theorem.

Combinatorics · Mathematics 2020-05-18 XinHua Xiong , William J. Keith

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

Combinatorics · Mathematics 2026-04-14 George E. Andrews , Aritram Dhar

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

Combinatorics · Mathematics 2026-01-27 Rahul Kumar , Nargish Punia

We analyse partitions of products with two ordered factors in two classes where both factors are countable or well-ordered and at least one of them is countable. This relates the partition properties of these products to cardinal…

Logic · Mathematics 2020-09-01 Lukas Daniel Klausner , Thilo Weinert

The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…

Combinatorics · Mathematics 2024-10-23 Shishuo Fu , Haijun Li

The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…

In this note we give three identities for partitions with parts separated by parity, which were recently introduced by Andrews.

Number Theory · Mathematics 2019-03-19 Kathrin Bringmann , Chris Jennings-Shaffer

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

Combinatorics · Mathematics 2024-07-01 Thomas Y. He , C. S. Huang , H. X. Li , X. Zhang

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of G\"ollnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at…

Combinatorics · Mathematics 2007-05-23 Krishnaswami Alladi , Alexander Berkovich

Inspired by a number of recent papers by Corteel, Dousse, Foda, Uncu and Welsh on cylindric partitions and Rogers-Ramanujan-type identities, we obtain the $\mathrm{A}_2$ (or $\mathrm{A}_2^{(1)}$) analogues of the celebrated Andrews-Gordon…

Combinatorics · Mathematics 2023-07-04 S. Ole Warnaar

A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…

Combinatorics · Mathematics 2023-12-29 Sergi Elizalde , Alejandro B. Galván

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

Combinatorics · Mathematics 2017-05-16 Shishuo Fu , Dazhao Tang

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…

Combinatorics · Mathematics 2022-04-07 Zhicong Lin , Huan Xiong , Sherry H. F. Yan

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

Number Theory · Mathematics 2020-10-20 Adriana L. Duncan , Simran Khunger , Holly Swisher , Ryan Tamura

A Known Alder-type partition inequality of level $a$, which involves the second Rogers-Ramanujan identity when the level $a$ is 2, states that the number of partitions of $n$ into parts differing by at least $d$ with the smallest part being…

Combinatorics · Mathematics 2023-08-08 Haein Cho , Soon-Yi Kang , Byungchan Kim

We investigate the number $N_{d,r}(s)$ of $(s, s+r)$-core integer partitions with $d$-distinct parts. Our first main result is a proof of a recurrence relation conjectured by Sahin in 2018. We also derive generating functions, asymptotics,…

Combinatorics · Mathematics 2019-08-19 Noah Kravitz