Seminars and Colloquia by Series

Efficiency of First-Fit Chain Partitioning Finite Partial Orders

Series
ACO Student Seminar
Time
Friday, September 28, 2018 - 13:15 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Michael WigalMath, Georgia Tech
Given a finite partially ordered set (poset) of width $w$, Dilworth's theorem gives an existence and minimality of a chain partition of size $w$. First-Fit is an online algorithm for creating a chain partition of a poset. Given a linear ordering of the points of the poset, $v_1, \cdots, v_n$, First-Fit assigns the point $v_i$ to the first available chain in the chain partition of the points $v_1, \cdots, v_{i-1}$. It is a known fact that First-Fit has unbounded performance over the family of finite posets of width 2. We give a complete characterization of the family of finite posets in which First-Fit performs with subexponential efficiency in terms of width. We will also review what is currently known on the family of posets in which First-Fit performs with polynomial efficiency in terms of width. Joint work with Kevin Milans.

Enriching Bézout’s Theorem

Series
Student Algebraic Geometry Seminar
Time
Thursday, September 27, 2018 - 13:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Stephen McKeanGeorgia Tech
Bézout’s Theorem is the classical statement that generic curves of degree c and d intersect in cd points. However, this theorem requires that we work over an algebraically closed field. Using some tools from A^1-algebraic topology, we will give an arithmetic generalization of Bézout’s Theorem. We will also describe the geometric implications of this generalization over the reals.

Counting integer points in polytopes

Series
School of Mathematics Colloquium
Time
Thursday, September 27, 2018 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Igor PakUCLA
Given a convex polytope P, what is the number of integer points in P? This problem is of great interest in combinatorics and discrete geometry, with many important applications ranging from integer programming to statistics. From computational point of view it is hopeless in any dimensions, as the knapsack problem is a special case. Perhaps surprisingly, in bounded dimension the problem becomes tractable. How far can one go? Can one count points in projections of P, finite intersections of such projections, etc? We will survey both classical and recent results on the problem, emphasizing both algorithmic and complexity aspects. Some elegant hardness results will make an appearance in dimension as small as three. If time permits, we will discuss connections to Presburger Arithmetic and decidability problems for irrational polyhedra. Joint work with Danny Nguyen.

Hypergraph cuts above the average

Series
Graph Theory Working Seminar
Time
Wednesday, September 26, 2018 - 16:30 for 1.5 hours (actually 80 minutes)
Location
Skiles 006
Speaker
Dantong ZhuGeorgia Tech
A classical result of Edwards says that every m-edge graph has a 2-cut of size m/2+Ω(√m), and this is best possible. We will continue our discussion about recent results on analogues of Edwards’ result and related problems in hypergraphs.

A discussion about the smooth Schoenflies' conjecture

Series
Geometry Topology Student Seminar
Time
Wednesday, September 26, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Agniva RoyGeorgia Tech
The Schoenflies' conjecture proposes the following: An embedding of the n-sphere in the (n+1)-sphere bounds a standard (n+1)-ball. For n=1, this is the well known Jordan curve theorem. Depending on the type of embeddings, one has smooth and topological versions of the conjecture. The topological version was settled in 1960 by Brown. In the smooth setting, the answer is known to be yes for all dimensions other than 4, where apart from one special case, nothing is known. The talk will review the question and attempt to describe some of the techniques that have been used in low dimensions, especially in the special case, that was worked out by Scharlemann in the 1980s. There are interesting connections to the smooth 4-dimensional Poincare conjecture that will be mentioned, time permitting. The talk is aimed to be expository and not technical.

$L^p$ restriction of eigenfunctions to random Cantor-type sets

Series
Analysis Seminar
Time
Wednesday, September 26, 2018 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Suresh EswarathasanCardiff University
Abstract: Let $(M,g)$ be a compact Riemannian n-manifold without boundary. Consider the corresponding $L^2$-normalized Laplace-Beltrami eigenfunctions. Eigenfunctions of this type arise in physics as modes of periodic vibration of drums and membranes. They also represent stationary states of a free quantum particle on a Riemannian manifold. In the first part of the lecture, I will give a survey of results which demonstrate how the geometry of $M$ affects the behaviour of these special functions, particularly their “size” which can be quantified by estimating $L^p$ norms. In joint work with Malabika Pramanik (U. British Columbia), I will present in the second part of my lecture a result on the $L^p$ restriction of these eigenfunctions to random Cantor-type subsets of $M$. This, in some sense, is complementary to the smooth submanifold $L^p$ restriction results of Burq-Gérard-Tzetkov ’06 (and later work of other authors). Our method includes concentration inequalities from probability theory in addition to the analysis of singular Fourier integral operators on fractals.

On the Log-Brunn-Minkowski inequality

Series
High Dimensional Seminar
Time
Wednesday, September 26, 2018 - 12:55 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Galyna LivshytsGeorgia Institute of technology

I shall tell about some background and known results in regards to the celebrated and fascinating Log-Brunn-Minkowski inequality, setting the stage for Xingyu to discuss connections with elliptiic operators a week later.

What is a formula?

Series
Research Horizons Seminar
Time
Wednesday, September 26, 2018 - 12:20 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Igor PakUniversity of California, Los Angeles
Integer sequences arise in a large variety of combinatorial problems as a way to count combinatorial objects. Some of them have nice formulas, some have elegant recurrences, and some have nothing interesting about them at all. Can we characterize when? Can we even formalize what is a "formula"? I will try to answer these questions by presenting many examples, results and open problems. Note: This is an introductory general audience talk unrelated to the colloquium.

Shapes of local minimizers for a model of capillary energy in periodic media

Series
PDE Seminar
Time
Tuesday, September 25, 2018 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
William FeldmanUniversity of Chicago
I will discuss the limit shapes for local minimizers of the Alt-Caffarelli energy. Fine properties of the associated pinning intervals, continuity/discontinuity in the normal direction, determine the formation of facets in an associated quasi-static motion. The talk is partially based on joint work with Charles Smart.

Pages