Systematic Counting of Restricted Partitions
Combinatorics
2019-10-29 v2 Number Theory
Abstract
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of partitions avoiding an arbitrary set of "patterns".
Cite
@article{arxiv.1910.08989,
title = {Systematic Counting of Restricted Partitions},
author = {Mingjia Yang and Doron Zeilberger},
journal= {arXiv preprint arXiv:1910.08989},
year = {2019}
}
Comments
11 pages. Accompanied by two Maple packages available from http://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/rpr.html