« A Positivity Phenomenon in Elser’s Gaussian-cluster Percolation Model
May 13, 2020, 1:00 PM - 2:00 PM
Location:
Online Event
Julie Vega, University of Kentucky
Veit Elser proposed a random graph percolation model in which physical dimension appears as a parameter. From this model, numerical graph invariants els_k (G) , called Elser numbers, naturally arise and Viet Elser conjectured that els_k (G) > 0 for all graph G and integers k > 2. In this talk we will interpret the Elser numbers as Euler characteristics of nucleus (simplicial) complexes and prove Elser’s conjecture.
This is joint work with Galen Dropalen-Barry, Cyrus Hettle, David Livingston, Jeremy Martin, George Nasr, and Hays Whitlatch.
SPECIAL NOTE: This seminar is presented online only.
You can join via ZOOM with Meeting ID: 268 276 468 or by clicking this link https://brown.zoom.us/j/268276468
For further information see: https://sites.google.com/view/gocc-combinatorics/home