Uncategorized

Algorithms, Combinatorics, and Optimization Seminar

Thursday, December 3, 2020 – 3:30pm to 4:30pm

Location:

Virtual Presentation Remote Access – Zoom

Speaker:

J. ANDREW NEWMAN, Postdoctoral Associate https://sites.google.com/view/andrewnewman775/home

Randomized construction of complexes with large diameter

The combinatorial diameter of a simplicial complex is defined to be the diameter of its dual graph. For n and d, one denotes by Hs(n,d) the maximum possible combinatorial diameter of a pure d-dimensional, strongly connected simplicial complex on n vertices. In this talk I discuss an application of the probabilistic method to give a new lower bound on Hs(n,d) that is within an O(d2) factor of the trivial upper bound. This is joint work with Francisco Criado.

Andrew Newman is currently a postdoc at Carnegie Mellon University in the Department of Mathematical Sciences. His research interests are in the intersection of topology, combinatorics, and probability, in particular the study of random simplicial complexes and applying the probabilistic method to problems in topology. He completed his Ph.D. at The Ohio State University in 2018, and prior to his  position at CMU, was a postdoc in the Facets of Complexity research training group working in the Discrete Mathematics and Geometry group at Technische Universität Berlin from 2018 to 2020.

Zoom Participation. See announcement.

Event Website:

http://aco.math.cmu.edu/seminar.html

For More Information, Contact:

Keywords:

Seminar Series

Similar Posts