Correspondence from Dean to John Herbert

Correspondence from Dean John F.X. Irving to John Herbert. Congratulating him and other newly elected BLSA officers. Also asking for assistance recruiting minority applicants and helping admitted minority applicants succeed in law school

He\u27s A Rag Picker

https://digitalcommons.library.umaine.edu/mmb-vp/1564/thumbnail.jp

Parking functions, tree depth and factorizations of the full cycle into transpositions

International audienceConsider the set Fn of factorizations of the full cycle (0 1 2 · · · n) ∈ S{0,1,...,n} into n transpositions. Write any such factorization (a1 b1) · · · (an bn) with all ai < bi to define its lower and upper sequences (a1, . . . , an) and (b1,...,bn), respectively. Remarkably, any factorization can be uniquely recovered from its lower (or upper) sequence. In fact, Biane (2002) showed that the simple map sending a factorization to its lower sequence is a bijection from Fn to the set Pn of parking functions of length n. Reversing this map to recover the factorization (and, hence, upper sequence) corresponding to a given lower sequence is nontrivial

If That\u27s Your Idea Of A Wonderful Time : Take Me Home

https://digitalcommons.library.umaine.edu/mmb-vp/1816/thumbnail.jp