The Diversity Committee and the Math For All Team are co-organizing a panel on the basics of academic job searches. Whether you are applying for jobs soon or in a few years, we think this information will be helpful. After the panelists share some words of wisdom on certain topics we will have a Q&A session.
The panelists and their topics are:
Agnès Beaudry (Research Statement Basics).
Lee Roberson (Teaching Statement Basics and Teaching Portfolios).
Alonso Delfín Ares de Parga (Tips on Searching for a Research-Focused Postdoc position).
Rebekah Jones (Tips on Searching for a Teaching-Focused Postdoc position).
Academic Job Panel
Tue, Mar. 19 2:30pm (MATH 3…
Dana Ernst (Northern Arizona University)
In this talk, we will discuss the architecture of braid graphs in simply-laced Coxeter systems. It turns out that every reduced expression has a unique factorization as a product of so-called links, which in turn induces a decomposition of the braid graph into a box product of the braid graphs for each link factor. When the Coxeter graph has no three-cycles, each braid graph is a median graph (i.e., for every triple of vertices, there is a unique vertex, called the median, that belongs to shortest paths between each pair). One consequence of this result is that every braid graph can be isometrically embedded into a hypercube. For a special class of reduced expressions, called Fibonacci links, we show that the corresponding braid graphs are Fibonacci cubes.
Braid graphs in simply-laced triangle-free Coxeter systems are median Sponsored by the Meyer Fund