Upcoming Events

We prove a new signed elementary symmetric function expansion of the chromatic symmetric function. We then use sign-reversing involutions to prove e -positivity for graphs formed by joining cycles or cliques at single vertices. By considering...

TBA

TBA

TBA

TBA

Let G = (V, E) be a simple graph of order n. The adjacency matrix of G is denoted by A(G) = [a_ij], where a_ij=1 if {v_i ,v_j} ∈ E and a_ij=0, otherwise. The diagonal matrix of degrees of G, D(G) = [d_ij], is defined by d_ii=d(v_i), and d_ij=0, ∀ i...

This will be an in-person version of a Zoom workshop to be given at Grad and Postdoc Studies in December. It is open to all grad students and postdocs, not just those on the job market this year. Please come, learn, ask questions afterwards and give...

I will give an overview of forthcoming work proving that large critical percolation clusters in high-dimensional lattices converge under rescaling to the expected universal limit object: superBrownian motion. A key step is to compute the first-order...

TBA

TBA