Multi-cores, posets, and lattice paths
Abstract
Hooks are prominent in representation theory (of symmetric groups) and they play a role in number theory (via cranks associated to Ramanujan's congruences). A partition of a positive integer has a Young diagram representation. To each cell in the diagram there is an associated statistic called hook length, and if a number is absent from the diagram then the partition is called a -core. A partition is an -core if it is both an - and a -core. Since the work of Anderson on -cores, the topic has received a growing attention. This paper expands the discussion to multiple-cores. More precisely, we explore -core partitions much in the spirit of a recent paper by Stanley and Zanello. In fact, our results exploit connections between three combinatorial objects: multi-cores, posets and lattice paths (with a novel generalization of Dyck paths). Additional results and conjectures are scattered throughout the paper. For example, one of these statements implies a curious symmetry for twin-prime -core partitions.
Cite
@article{arxiv.1406.2250,
title = {Multi-cores, posets, and lattice paths},
author = {Tewodros Amdeberhan and Emily Leven},
journal= {arXiv preprint arXiv:1406.2250},
year = {2015}
}