English
Related papers

Related papers: A bijection proof of Andrews-Merca integer partiti…

200 papers

The crank-mex theorem states that the number of integer partitions of $n$ with nonnegative crank equals the number with odd minimal excludant (mex). Andrews and M. Newman recently refined that result in terms of the number of parts greater…

Combinatorics · Mathematics 2025-11-26 George E. Andrews , Brian Hopkins

In this paper, we study restricted excludant statistics depending on its parity in partitions where parts with same parity are distinct. Using $q$-series transformations, we show that generating functions of these partition statistics are…

Number Theory · Mathematics 2026-03-17 Gargi Mukherjee

Recently, Andrews proved two conjectures on a partition statistic introduced by Beck. Very recently, Chern established some results on weighted rank and crank moments and proved many Andrews-Beck type congruences. Motivated by Andrews and…

Number Theory · Mathematics 2023-08-14 Yang Lin , Ernest X. W. Xia , Xuan Yu

Recently, Schneider and Schneider defined a new class of partitions called sequentially congruent partitions, in which each part is congruent to the next part modulo its index, and they proved two partition bijections involving these…

Combinatorics · Mathematics 2022-08-10 Ezekiel Cochran , Madeline Locus Dawsey , Emma Harrell , Samuel Saunders

Let $p_2(n)$ denote the number of cubic partitions. In this paper, we shall present two new congruences modulo $11$ for $p_2(n)$. We also provide an elementary alternative proof of a congruence established by Chan. Furthermore, we will…

Number Theory · Mathematics 2017-02-14 Shane Chern , Manosij Ghosh Dastidar

We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…

Combinatorics · Mathematics 2007-12-12 Anisse Kasraoui , Jiang Zeng

We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…

Number Theory · Mathematics 2025-10-03 Aidan Botkin , Madeline L. Dawsey , David J. Hemmer , Matthew R. Just , Robert Schneider

Recently, Amdeberhan, Sellers, and Singh introduced the notion of a generalized cubic partition function $a_c(n)$ and proved two isolated congruences via modular forms, namely, $a_3(7n+4)\equiv 0\pmod{7}$ and $a_5(11n+10)\equiv 0\pmod{11}$.…

Number Theory · Mathematics 2025-03-03 Russelle Guadalupe

The number of standard Young tableaux possible of shape corresponding to a partition $\lambda$ is called the dimension of the partition and is denoted by $f^{\lambda}$. Partitions with odd dimensions were enumerated by McKay and were…

Combinatorics · Mathematics 2025-11-18 Aditya Khanna

We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts…

Number Theory · Mathematics 2023-02-03 Cristina Ballantine , Mircea Merca

The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{11}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}.\] In this paper, we prove infinite families of…

Number Theory · Mathematics 2019-06-04 Shashika Petta Mestrige

Let $ped(n)$ denote the number of partitions of $n$ wherein even parts are distinct (and odd parts are unrestricted). We show infinite families of congruences for $ped(n)$ modulo $8$. We also examine the behavior of $ped_{-2}(n)$ modulo $8$…

Number Theory · Mathematics 2014-04-23 Haobo Dai

Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…

Combinatorics · Mathematics 2011-06-16 William Y. C. Chen , Daniel K. Du , Charles B. Mei

In this paper, we prove a conjecture of Andrews and Bachraoui relating a generating function arising from two-color partitions (with odd smallest part and restrictions on the even parts) to a Hecke-type double sum. Our proof is based on…

Number Theory · Mathematics 2026-05-12 Koustav Banerjee , Kathrin Bringmann

An ordered partition of [n]:={1,2,..., n} is a sequence of its disjoint subsets whose union is [n]. The number of ordered partitions of [n] with k blocks is k!S(n,k), where S(n,k) is the Stirling number of second kind. In this paper we…

Combinatorics · Mathematics 2007-05-23 Masao Ishikawa , Anisse Kasraoui , Jiang Zeng

Let $p_k(n)$ denote the number of $2$-color partitions of $n$ where one of the colors appears only in parts that are multiples of $k$. We will prove a conjecture of Ahmed, Baruah, and Dastidar on congruences modulo $5$ for $p_k(n)$.…

Number Theory · Mathematics 2016-02-10 Shane Chern

In this paper we study $b_5(n)$, the $5$-regular partitions of $n$. Using the theory of modular forms, we prove several theorems on the divisibility and distribution properties of $b_5(n)$ modulo prime $m\geq5$. In particular, we prove that…

Number Theory · Mathematics 2022-08-04 Qi-Yang Zheng

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

Number Theory · Mathematics 2023-06-13 Darlison Nyirenda , Beaullah Mugwangwavari

Johnson recently proved Armstrong's conjecture which states that the average size of an $(a,b)$-core partition is $(a+b+1)(a-1)(b-1)/24$. He used various coordinate changes and one-to-one correspondences that are useful for counting…

Combinatorics · Mathematics 2017-11-07 Jineon Baek , Hayan Nam , Myungjun Yu

In this paper we provide a bijective proof of a theorem of Garsia and Gessel describing the generating function of the major index over the set of all permutations of [n]={1,...,n} which are shuffles of given disjoint ordered sequences…

Combinatorics · Mathematics 2009-06-03 Moti Novick