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

In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for $ n $ large enough, the two…

We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…

This note introduces some bijections relating core partitions and tuples of integers. We apply these bijections to count the number of cores with various types of restriction, including fixed number of parts, limited size of parts, parts…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most…

We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…

George Andrews and Peter Paule have recently conjectured an infinite family of congruences modulo powers of 3 for the 2-elongated plane partition function $d_2(n)$. This congruence family appears difficult to prove by classical methods. We…

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…

In 2008, Wang \& Wang showed that the set of gaps of a numerical semigroup generated by two coprime positive integers $a$ and $b$ is equidistributed modulo 2 precisely when $a$ and $b$ are both odd. Shor generalized this in 2022, showing…

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

Recently, Merca and Schmidt proved a number of identities relating partitions of an integer with two classic number-theoretic functions, namely the M\"obius function and Euler's totient function. Their demonstrations were mainly algebraic.…

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

Amdeberhan conjectured that the number of $(s,s+2)$-core partitions with distinct parts for an odd integer $s$ is $2^{s-1}$. This conjecture was first proved by Yan, Qin, Jin and Zhou, then subsequently by Zaleski and Zeilberger. Since the…

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

Based on a classical result on partitions of an integer into a finite set of positive integers, we establish a general positivity result on coefficients of certain $q$-series which uniformly refines the positivity of truncated pentagonal…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…

Extending Sellers' result, Das et al. recently proved some congruence results for generalized overcubic partitions using theta functions and posed some related conjectures. In this paper, we provide a combinatorial proof of a result in…