Related papers: ($\ell,0)$-Carter partitions, a generating functio…
Some of the classical results of Ramsey Theory can be naturally stated in terms of image partition regularity of matrices. There have been many significant results of image partition regular matrices as well as image partition regular…
Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…
The main result here gives an algebra(/linear category) isomorphism between a geometrically defined subcategory $J^1_0$ of a short Brauer category $J_0$ and a certain one-parameter specialisation of the blob category $b$. That is, we prove…
An ordered partition of [n]:={1,2,..., n} is a sequence of its disjoint subsets whose union is [n]. The number of ordered partitions of [n] with k blocks is k!S(n,k), where S(n,k) is the Stirling number of second kind. In this paper we…
We study a quartic matrix model with partition function $Z=\int d\ M\exp{\rm Tr}\ (-\Delta M^2-\frac{\lambda}{4}M^4)$. The integral is over the space of Hermitian $(\Lambda+1)\times(\Lambda+1)$ matrices, the matrix $\Delta$, which is not a…
Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…
Given a graph $G$ on $n$ vertices, for which $m$ is it possible to partition the edge set of the $m$-fold complete graph $mK_n$ into copies of $G$? We show that there is an integer $m_0$, which we call the \emph{partition modulus of $G$},…
We introduce the edge Schur functions $E^{\lambda}$ that are defined as a generating series over edge labeled tableaux. We formulate $E^{\lambda}$ as the partition function for a solvable lattice model, which we use to show they are…
Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory,…
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…
Recently, there has been a lot of work on combinatorial inequalities related to hook-lengths in $t$-regular partitions. In this short note, we give a proof using generating functions for a result proved by Singh and Barman (2026) using…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…
In a recent paper, Andrews and Merca investigated the number of even parts in all partitions of $n$ into distinct parts, which arise naturally from the Euler-Glaisher bijective proof. They obtained new combinatorial interpretations for this…
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…
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…
The notion of exponential Dowling structures is introduced, generalizing Stanley's original theory of exponential structures. Enumerative theory is developed to determine the M\"obius function of exponential Dowling structures, including a…
The central object of study is a formal power series that we call the content series, a symmetric function involving an arbitrary underlying formal power series $f$ in the contents of the cells in a partition. In previous work we have shown…
Using purely combinatorial methods we calculate the first degree cohomology of Specht modules indexed by two part partitions over fields of characteristic $p\ge 3$. These combinatorial methods also allow us to obtain an explicit description…
We first describe, over a field K of characteristic different from 2, the orbits for the adjoint actions of the Lie groups PGL(2, K) and PSL(2, K) on their Lie algebra sl(2, K). While the former are well known, the latter lead to the…