Identifying Combinatorial Structures for Binary Strings and Set Partitions

Abstract

The goal of enumerative combinatorics is to count the number of some well described objects. We extend the algorithm of Bean et al. that automates this process to work with binary strings and set partitions. This involves teaching the computer about binary strings, set partitions, and the ideas behind the proofs of results in this area.