Related papers: Some Elementary Partition Inequalities and Their I…

A partition n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k is called non-squashing if p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the…

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…

We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…

It is well known that the number of partitions into distinct even parts equals the number of $4$-regular partitions. In this paper we prove identities relating certain restricted partitions into distinct even parts with restricted…

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…

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…

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

Jaclyn Anderson proved that if s and t are relatively prime positive integers, then there are exactly (s+t-1)!/(s!t!) partitions whose set of hook-lengths is disjoint from the set {s,t}. Drew Armstrong conjectured (and Paul Johnson, and a…

For two particles with different spin, we derive the Bell's inequality. The inequality is investigated for two systems combining spin-1 and 1/2; spin-1/2 and 3/2. We show that for these states Bell's inequality is violated.

We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

In this paper, we prove some new \(q\)-series identities connecting \(4\)-regular partitions and partitions with distinct even parts with largest part being odd. We also define three new partition functions with distinct even parts except…

In this note, we first bound the intersection number of the regular simplicial partitions.

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

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…

In this paper, we consider the asymptotic properties of hook numbers of partitions in restricted classes. More specifically, we compare the frequency with which partitions into odd parts and partitions into distinct parts have hook numbers…

Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…

We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…