Project description: Descent in a permutation a₁ ... a_n is a pair of adjacent elements a_i > a_i+1. For example, the permutation 52314 has two descents: 5>2 and 3>1. Descents are well-studied in combinatorics and this project will investigate how much some of the properties of descents in permutations carry over in the setting of rooted labeled trees (connected graphs with no cycles and a distinguished vertex called a root).

Prerequisites:   familiarity with counting permutations and combinations.

Project faculty:
Prof. Svetlana Poznanović
Email: spoznan at clemson.edu (change "at" to "@")
Office hours: TBA
Bio: coming soon