Related papers: ($\ell,0)$-Carter partitions, a generating functio…

Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…

Let $\Lambda$ be a finite-dimensional algebra over a field $K$. We describe how Buan and Marsh's $\tau$-exceptional sequences can be used to give a "brick labeling" of a certain poset of wide subcategories of finitely-generated…

Over fields of characteristic zero, there are well known construction of the irreducible representations and of irreducible modules, called Specht modules for the symmetric groups $S_{n}$ which are based on elegant combinatorial concepts…

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

Let $q$ be a prime power, $G=GL_n(q)$ and let $U\leqslant G$ be the subgroup of (lower) unitriangular matrices in $G$. For a partition $\lambda$ of $n$ denote the corresponding unipotent Specht module over the complex field $\C$ for $G$ by…

For a numerical semigroup $S := \langle n_1, \dots, n_k \rangle$ with minimal generators $n_1 < \cdots < n_k$, Barron, O'Neill, and Pelayo showed that $L(s+n_1) = L(s) + 1$ and $\ell(s+n_k) = \ell(s) + 1$ for all sufficiently large $s \in…

Let H_q(S_n) be the Iwahori-Hecke algebra of the symmetric group. This algebra is semisimple over the rational function field Q(q), where q is an indeterminate, and its irreducible representations over this field are q-analogues S_q(lambda)…

A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…

A unital $\ell$-group is an abelian group equipped with a translation invariant lattice-order and with a distinguished strong unit, i.e. an element whose positive integer multiples eventually dominate every element of $G$.If $X$ is a…

Let $b_{\ell, k}(n), b_{\ell, k, r}(n)$ count the number of $(\ell, k)$, $(\ell, k, r)$-regular partitions respectively. In this paper we shall derive infinite families of congruences for $b_{\ell, k}(n)$ modulo $2$ when $ (\ell, k) =…

We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…

For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0.…

Over fields of characteristic zero, there are well known constructions of the irreducible representations, due to A Young, and of irreducible modules, called Specht modules, due to W Specht, for the symmetric groups $S_{n}$ which are based…

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…

For each $n\geqslant3$, we construct an uncountable family of models of the crystal of the basic $U_q(\hat{\mathfrak{sl}}_n)$-module. These models are all based on partitions, and include the usual $n$-regular and $n$-restricted models, as…

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…