Problems of Enumeration and Realizability on Matroids, Simplicial Complexes, and GraphsYvonne Kemper
Applied and Computational Mathematics Division, NIST
Wednesday, August 6, 2014 15:00-16:00,
What does a combinatorial space look like? How is it put together? How many are there? These fundamental questions and others like them give rise to two important themes in geometric combinatorics: realizability and enumeration. In this (friendly, fun, and not-for-profit) talk, we introduce three such problems (as well as the relevant background) and explore recent research and future directions.
Speaker Bio: Yvonne received her BA in Math and Astrophysics from UC Berkeley, then completed her PhD in mathematics at UC Davis under Jesus De Loera and Matthias Beck. After a suitable amount of time bumming around Europe and Northern Africa, she joined NIST as an NRC Post-doc with Isabel Beichl. She is excited to hear about your graphs, matroids, lattices, simplicial complexes (or other objects) and their combinatorics and geometry!
Contact: B. Cloteaux
Note: Visitors from outside NIST must contact Cathy Graham; (301) 975-3800; at least 24 hours in advance.