Systematic Counting of Restricted Partitions
arXiv:1910.08989
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".
11 pages. Accompanied by two Maple packages available from http://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/rpr.html