arXiv Analytics

Sign in

arXiv:1508.00397 [math.CO]AbstractReferencesReviewsResources

Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts

Felix Breuer, Dennis Eichhorn, Brandt Kronholm

Published 2015-08-03Version 1

In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn allows us to define statistics called {\it supercranks} that combinatorially witness every instance of divisibility of $p(n,3)$ by any prime $m \equiv -1 \pmod 6$, where $p(n,3)$ is the number of partitions of $n$ into three parts. A rearrangement of lattice points allows us to demonstrate with explicit bijections how to divide these sets of partitions into $m$ equinumerous classes. The behavior for primes $m' \equiv 1 \pmod 6$ is also discussed.

Comments: 28 pages, 19 figures
Categories: math.CO, math.NT
Subjects: G.2.1
Related articles: Most relevant | Search more
arXiv:1405.7647 [math.CO] (Published 2014-05-29, updated 2014-07-22)
An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics
arXiv:0902.1072 [math.CO] (Published 2009-02-06, updated 2009-11-26)
Combinatorics and Genus of Tropical Intersections and Ehrhart Theory
arXiv:1412.0196 [math.CO] (Published 2014-11-30)
Discrete Equidecomposability and Ehrhart Theory of Polygons