Systematic Counting of Restricted Partitions

By Mingjia Yang and Doron Zeilberger

.pdf    .tex   

Posted: Oct. 20, 2019

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 descrive two approaches for the systematic counting of classes of partitions avoiding an arbitrary set of "patterns".

Maple packages

Sample Input and Output for RPpos.txt

Sample Input and Output for RPneg.txt

Articles of Doron Zeilberger

Doron Zeilberger's Home Page

Mingjia Yang's Home Page