Project Description:<\/b> The Catalan numbers are a sequence that is ubiquitous in combinatorics. In this project, we will explore the Catalan numbers and generalizations such as the Fuss-Catalan numbers, rational Catalan numbers, and others We will study problems in enumerative combinatorics which may relate to these sequences.<\/p>\n
For example, we will investigate certain pattern avoidance conditions in k-regular words (i.e. permutations of the multi-set containing k copies of each number in {1,\u2026,n}). This is inspired by recent work of Laudone (arXiv:2608.21351) who studied the special case of canon permutations, and showed that the number of canon permutations avoiding any of the patterns 112, 122, 211, or 221 is counted by the Fuss-Catalan numbers. <\/p>\n
Project Level:<\/b> Intermediate: students who have taken Math 300
\nAdditional Course Requirements:<\/b> Math 461 (combinatorics) preferred
\nProgramming Requirements:<\/b> <\/p>\n
\n","protected":false},"excerpt":{"rendered":"
Catalan Combinatorics Faculty Mentor: Dr. Elena Hafner Project Description: The Catalan numbers are a sequence that is ubiquitous in combinatorics. In this project, we will explore the Catalan numbers and generalizations such as the Fuss-Catalan numbers, rational Catalan numbers, and others We will study problems in enumerative combinatorics which may relate to these sequences. For…<\/p>\n