Related papers: On Glaisher's Partition Theorem

We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…

I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n…

A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…

This article provides a proof of a generalization of Schur's theorem on the partition regularity of the equation x+y=z, which involves a divisibility condition. This generalization will be utilized to prove the existence of 'small'…

We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

Recently, Andrews, Bhattacharjee and Dastidar introduced the concept of $k$-measure of an integer partition, and proved a surprising identity that the number of partitions of $n$ which have $2$-measure $m$ is equal to the number of…

Franklin's identity generalizes Euler's identity and states that the number of partitions of $n$ with $j$ different parts divisible by $r$ equals the number of partitions of $n$ with $j$ repeated parts. In this article, we give a refinement…

In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…

Define a "nuclear partition" to be an integer partition with no part equal to one. In this study we prove a simple formula to compute the partition function $p(n)$ by counting only the nuclear partitions of $n$, a vanishingly small subset…

We discuss a new companion to Capparelli's identities. Capparelli's identities for m=1,2 state that the number of partitions of $n$ into distinct parts not congruent to m, -m modulo $6$ is equal to the number of partitions of n into…

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$.

We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

A $k$-regular partition into distinct parts is a partition into distinct parts with no part divisible by $k$. In this paper, we provide a general method to establish the unimodality of $k$-regular partition into distinct parts where the…

The restricted partition function $p_N(n)$ counts the partitions of the integer $n$ into at most $N$ parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and,…