Project Description
Flattened partitions are permutations with patterns where the leading terms of each run are in increasing order. In recent work with students at the Institute for Computational Research in Mathematics (ICERM) we considered a generalization to flattened partitions called flattened S-insertion parking functions. In this project, we will study and enumerate flattened words in which the alphabet repeats each value twice with the goal of providing recursive formulas to enumerate the number of flattened words with exactly k runs.
Tasks and Responsibilites
Computing examples, creating code for the project, writing results in overleaf (LaTeX), writing a manuscript for publication with results proved by the student. Presenting research at local conferences and at the SURF symposium as well as for the Math Club.