Related papers: Generating function for K-restricted jagged partit…

For $n$ and $k$ integers we introduce the notion of some partition of $n$ being able to generate another partition of $n$. We solve the problem of finding the minimum size partition for which the set of partitions this partition can…

We investigate some weighted integer partitions whose generating functions are double-series. We will establish closed formulas for these $q$-double series and deduce that their coefficients are non-negative. This leads to inequalities…

This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n,k$ and $p_1\le p_2\le \cdots\le p_k$ such that $p_1+\cdots+p_k=n$ and $k$ divides $\sum_{i=1}^ni$, we study…

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…

Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $k\geq2$. This enables us to extend the $k$-colored partition function multiplicatively to a…

Let $B_{k,i}(n)$ be the number of partitions of $n$ with certain difference condition and let $A_{k,i}(n)$ be the number of partitions of $n$ with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that…

The $k$-measure of an integer partition was recently introduced by Andrews, Bhattacharjee and Dastidar. In this paper, we establish trivariate generating function identities counting both the length and the $k$-measure for partitions and…

Answering a question of Cameron, Pretzel and Siemons proved that every integer partition of $n\ge 2(k+3)(k+1)$ can be reconstructed from its set of $k$-deletions. We describe a new reconstruction algorithm that lowers this bound to $n\ge…

In this work, we study type B set partitions for a given specific positive integer $k$ defined over $\langle n\rangle=\{-n, -(n-1),\cdots -1,0,1,\cdots n-1,n\}$. We found a few generating functions of type B analogue for some of the set…

Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of $n$ with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD(3n+2) is…

In his important 1920 paper on partitions, MacMahon defined the partition generating functions \begin{align*} A_k(q)=\sum_{n=1}^{\infty}\mathfrak{m}(k;n)q^n&:=\sum_{0< s_1<s_2<\cdots<s_k}…

The generating function for the number of purely crossing partitions of {1,...,n} is found in terms of the generating function for Bell numbers. Further results about generating functions for asymptotic moments of certain random Vandermonde…

The restricted partition function $p_{N}(n)$ counts the partitions of $n$ into at most $N$ parts. In the nineteenth century Sylvester showed that these partitions can be expressed as a sum of $k$-periodic quasi-polynomials ($1\leq k\leq N$)…

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,…

We present several conjectures on the behavior and clustering properties of Jack polynomials at \emph{negative} parameter $\alpha=-\frac{k+1}{r-1}$, of partitions that violate the $(k,r,N)$ admissibility rule of Feigin \emph{et. al.}…

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…

Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…