Related papers: ($\ell,0)$-Carter partitions, a generating functio…
A partition is a $\bar{s}$-core if it is the result of removing all of the $s$-bars from a partition. We extend a method of Olsson and Bessenrodt to determine the number of even partitions that are simultaneously $\bar{s}$-core and…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…
Since Henrik Strietz's 1975 paper proving that the lattice Part($n$) of all partitions of an $n$-element finite set is four-generated, more than half a dozen papers have been devoted to four-element generating sets of this lattice. We prove…
Johnstone demonstrated that Heyting semilattices form a semi-abelian category via a specific triple of terms. Inspired by this work, we introduce \emph{Johnstone algebras} or J-algebras. The algebraic $(*,\to,e)$-theory $J$ of arities…
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…
We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…
Schur-Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
We study plane partitions satisfying condition $a_{n+1,m+1}=0$ (this condition is called "pit") and asymptotic conditions along three coordinate axes. We find the formulas for generating function of such plane partitions. Such plane…
Let $p$ be prime, and let $p_{[1,p]}(n)$ denote the function whose generating function is $\prod (1-q^n)^{-1}(1 - q^{pn})^{-1}$. This function and its generalizations $p_{[c^{\ell}, d^m]}(n)$ are the subject of study in several recent…
Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…
In this paper, we consider plane partitions $\text{PP}(\lambda; m)$ of a given shape $\lambda$, with entries at most $m$. We prove that the distributions of two statistics on $\text{PP}(\lambda; m)$ coincide: one is the number of rows…
Let $R_n$ denote the KLR algebra of type $A^{(1)}_{e-1}$. Using the presentation of Specht modules given by Kleschev-Mathas-Ram, Loubert completely determined $\hom_{R_n}(S^\mu,S^\lambda)$ where $\mu$ is an arbitrary partition, $\lambda$ is…
Recently, Amdeberhan et al. proved congruences for the number of hooks of fixed even length among the set of self-conjugate partitions of an integer $n$, therefore answering positively a conjecture raised by Ballantine et al.. In this…
In this paper, we introduce Gram matrices for the signed partition algebras, the algebra of $\mathbb{Z}_2$-relations and the partition algebras. We prove that the Gram matrix is similar to a matrix which is a direct sum of block…
In this article we prove that the lattice of noncrossing partitions is EL-shellable when associated with the well-generated complex reflection group of type $G(d,d,n)$, for $d,n\geq 3$, or with the exceptional well-generated complex…
The irreducible representations of symmetric groups can be realized as certain graded pieces of invariant rings, equivalently as global sections of line bundles on partial flag varieties. There are various ways to choose useful bases of…
For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…