Related papers: Generalizing a partition theorem of Andrews

George Andrews [\emph{Bull. Amer. Math. Soc.}, 2007, 561--573] introduced the idea of a \emph{signed partiton} of an integer; similar to an ordinary integer partitions, but where some of the parts could be negative. Further, Andrews…

We present an involution on set partitions that interchanges two statistics related to relative size of block entries and use it to establish an equidistribution on objects counted by the Bessel numbers.

Given an integer $n$, we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts in $\{1,2,\dots, n-1\}$. Starting from an abelian subring, we…

We denote the number of partitions of $n$ wherein the even parts are distinct (and the odd parts are unrestricted) by $ped(n)$. In this paper, we will use generating function manipulations to obtain new congruences for $ped(n)$ modulo $24$.

We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

We present a conjecture about partitions, with a very elementary formulation.

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…

Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

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

This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…

In a 2016 paper, Straub proved an analogue to Euler's partition identity for partitions with fixed perimeter. Later, Fu and Tang provided a refinement and generalization of Straub's analogue to $d$-distinct partitions as well as a result…

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…

A partition of the positive integers into sets $A$ and $B$ {\em avoids} a set $S\subset\N$ if no two distinct elements in the same part have a sum in $S$. If the partition is unique, $S$ is {\em uniquely avoidable.} For any irrational…

Sylvester showed that the partition of an integer into a set of positive integers can be represented as a sum of the polynomial term and quasiperiodic components called the Sylvester waves. The wave itself is a weighted sum of the…

In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…