- You are here:
- GT Home
- Home
- News & Events

Series: Combinatorics Seminar

Series: Combinatorics Seminar

Suppose we want to find the largest independent set or maximal cut in a sparse Erdos-Renyi graph, where the average degree is constant. Many algorithms proceed by way of local decision rules, for instance, the "nibbling" procedure. I will explain a form of local algorithms that captures many of these. I will then explain how these fail to find optimal independent sets or cuts once the average degree of the graph gets large. There are some nice connections to entropy and spin glasses.

Wednesday, November 29, 2017 - 13:55 ,
Location: Skiles 006 ,
Anubhav Mukherjee ,
Georgia Tech ,
Organizer: Jennifer Hom

Series: Analysis Seminar

In
this talk, I will discuss some polynomials that are best approximants
(in some sense!) to reciprocals of functions in some analytic function
spaces of the unit disk. I will examine the extremal
problem of finding a zero of minimal modulus, and will show how that
extremal problem is related to the spectrum of a certain Jacobi matrix
and real orthogonal polynomials on the real line.

Series: PDE Seminar

Series: Combinatorics Seminar

Official School Holiday: Thanksgiving Break

Series: Geometry Topology Seminar

Series: Combinatorics Seminar

Series: Analysis Seminar

Wednesday, November 15, 2017 - 13:55 ,
Location: Skiles 006 ,
Surena Hozoori ,
Georgia Tech ,
Organizer: Jennifer Hom