Related papers: Multi-cores, posets, and lattice paths

In a recent paper, Bringmann, Craig, Ono, and the author showed that the number of $t$-hooks ($t\geq2$) among all partitions of $n$ is not always asymptotically equidistributed on congruence classes $a \pmod{b}$. In this short note, we…

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…

The Frobenius symbol was first introduced in 1900 by Frobenius as a way to encode an integer partition. In 1941, motivated by the modular representation theory of the symmetric group, Nakayama introduced the idea of a p-core partition, for…

We show that the poset of non-trivial partitions of 1,2,...,n has a fundamental homology class with coefficients in a Lie superalgebra. Homological duality then rapidly yields a range of known results concerning the integral representations…

Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…

The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he…

We give relations between the joint distributions of multiple hook lengths and of frequencies and part sizes in partitions, extending prior work in this area. These results are discovered by investigating truncations of the…

A cascade of dihedral symmetries is hidden in Young's lattice of integer partitions. In fact, for each integer N>2 the Hasse graph of the subposet consisting of the partitions with maximal hook length strictly less than N has the dihedral…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the…

We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…

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…

Multiplex networks are convenient mathematical representations for many real-world -- biological, social, and technological -- systems of interacting elements, where pairwise interactions among elements have different flavors. Previous…

Recent works at the interface of algebraic combinatorics, algebraic geometry, number theory, and topology have provided new integer-valued invariants on integer partitions. It is natural to consider the distribution of partitions when…

This is a survey on the categorification of the poset of generalized non-crossing partitions, using the representation theory of a hereditary artin algebra H, looking at the set P of exceptional subcategories in mod H. This categorification…

For a positive integer $s$, an $s$-club in a graph $G$ is a set of vertices inducing a subgraph with diameter at most $s$. As generalizations of cliques, $s$-clubs offer a flexible model for real-world networks. This paper addresses the…

Let $\ell,k$ be fixed positive integers. In an earlier work, the first and third authors established a bijection between $\ell$-cores with first part equal to $k$ and $(\ell-1)$-cores with first part less than or equal to $k$. This paper…