Seminars and Colloquia by Series

On Higher-Dimensional Oscillation in Ergodic Theory

Series
Analysis Seminar
Time
Wednesday, November 6, 2013 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Ben KrauseUCLA
We will discuss the fine notion of the pointwise convergence of ergodic averages in setting where one the ergodic transformation is a Z^d action, and the averages are over more exotic sets than just cubes. In this setting, pointwise convergence does not follow from the usual ergodicity arguments. Bourgain, in his study of the polynomial ergodic averages invented the variational technique, which we extend to our more exotic averages.

A general learning framework in vector-valued Reproducing Kernel Hilbert Spaces

Series
Applied and Computational Mathematics Seminar
Time
Tuesday, November 5, 2013 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Ha Quang, MinhIstituto Italiano di Technologia (IIT), Genova, Italy
Reproducing kernel Hilbert spaces (RKHS) have recently emerged as a powerful mathematical framework for many problems in machine learning, statistics, and their applications. In this talk, we will present a formulation in vector-valued RKHS that provides a unified treatment of several important machine learning approaches. Among these, one is Manifold Regularization, which seeks to exploit the geometry of the input data via unlabeled examples, and one is Multi-view Learning, which attempts to integrate different features and modalities in the input data. Numerical results on several challenging multi-class classification problems demonstrate the competitive practical performance of our approach.

Tropical schemes, tropical cycles, and valuated matroids

Series
Algebra Seminar
Time
Monday, November 4, 2013 - 16:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Diane MaclaganUniversity of Warwick
The tropical cycle associated to a subvariety of a torus is the support of a weighted polyhedral complex that that records information about the original variety and its compactifications. In a recent preprint Jeff and Noah Giansiracusa introduced a notion of scheme structure for tropical varieties, and showed that the tropical variety as a set is determined by this tropical scheme structure. I will outline how to also recover the tropical cycle from this information. This involves defining a variant of Grobner theory for congruences on the semiring of tropical Laurent polynomials. The lurking combinatorics is that of valuated matroids. This is joint work with Felipe Rincon.

A history of psd and sos polynomials (before the work of the speaker and his host)

Series
Algebra Seminar
Time
Monday, November 4, 2013 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Bruce ReznickUniversity of Illinois, Urbana-Champaign
A real polynomial is called psd if it only takes non-negative values. It is called sos if it is a sum of squares of polynomials. Every sos polynomial is psd, and every psd polynomial with either a small number of variables or a small degree is sos. In 1888, D. Hilbert proved that there exist psd polynomials which are not sos, but his construction did not give any specific examples. His 17th problem was to show that every psd polynomial is a sum of squares of rational functions. This was resolved by E. Artin, but without an algorithm. It wasn't until the late 1960s that T. Motzkin and (independently) R.Robinson gave examples, both much simpler than Hilbert's. Several interesting foundational papers in the 70s were written by M. D. Choi and T. Y. Lam. The talk is intended to be accessible to first year graduate students and non-algebraists.

Nonlocal models for insect swarms

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 4, 2013 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Chad Higdon-TopazMacalester College
From bird flocks to ungulate herds to fish schools, nature abounds with examples of biological aggregations that arise from social interactions. These interactions take place over finite (rather than infinitesimal) distances, giving rise to nonlocal models. In this modeling-based talk, I will discuss two projects on insect swarms in which nonlocal social interactions play a key role. The first project examines desert locusts. The model is a system of nonlinear partial integrodifferential equations of advection-reaction type. I find conditions for the formation of an aggregation, demonstrate transiently traveling pulses of insects, and find hysteresis in the aggregation's existence. The second project examines the pea aphid. Based on experiments that motion track aphids walking in a circular arena, I extract a discrete, stochastic model for the group. Each aphid transitions randomly between a moving and a stationary state. Moving aphids follow a correlated random walk. The probabilities of motion state transitions, as well as the random walk parameters, depend strongly on distance to an aphid’s nearest neighbor. For large nearest neighbor distances, when an aphid is isolated, its motion is ballistic and it is less likely to stop. In contrast, for short nearest neighbor distances, aphids move diffusively and are more likely to become stationary; this behavior constitutes an aggregation mechanism.

The structure of high distance Heegaard splittings

Series
Geometry Topology Seminar
Time
Monday, November 4, 2013 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jesse JohnsonOklahoma State University
The notion of distance for a Heegaard splitting of athree-dimensional manifold $M$, introduced by John Hempel, has provedto be a very powerful tool for understanding the geometry and topologyof $M$. I will describe how distance, and a slight generalizationknown as subsurface projection distance, can be used to explore theconnection between geometry and topology at the center of the moderntheory hyperbolic three-manifolds.In particular, Schalremann-Tomova showed that if a Heegaard splittingfor $M$ has high distance then it will be the only irreducibleHeegaard splitting of $M$ with genus less than a certain bound. I willexplain this result in terms of both a geometric proof and atopological proof. Then, using the notion of subsurface distance, Iwill describe a construction of a manifold with multiple distinctlow-distance Heegaard splittings of the same (small) genus, and amanifold with both a high distance, low-genus Heegaard splitting and adistinct, irreducible high-genus, low-distance Heegaard splitting.

Atlanta Lecture Series in Combinatorics and Graph Theory X

Series
Other Talks
Time
Saturday, November 2, 2013 - 09:00 for 8 hours (full day)
Location
Emory University, Room W201, Math and Science Center
Speaker
Dhruv MubayiUniversity of Illinois at Chicago
Emory University, Georgia Tech and Georgia State University, with support from the National Science Foundation and the National Security Agency, will continue the series of mini-conferences and host a series of 9 new mini-conferences from 2013-2016. The first new and 10th overall of these mini-conferences will be held at Emory University on November 2-3, 2013. The conferences will stress a variety of areas and feature one prominent researcher giving 2 fifty minute lectures and 4 outstanding researchers each giving one fifty minute lecture. There will also be several 25 minute lecturers by younger reseachers or graduate students.

A quantitative Brunn-Minkowski inequality and estimates on the the remainder in the Riesz rearrangement inequality.

Series
Math Physics Seminar
Time
Friday, November 1, 2013 - 16:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Eric CarlenRutgers University
We prove a quantitative Brunn-Minkowski inequality for sets E and K,one of which, K, is assumed convex, but without assumption on the other set. We are primarily interested in the case in which K is a ball. We use this to prove an estimate on the remainder in the Riesz rearrangement inequality under certain conditions on the three functions involved that are relevant to a problem arising in statistical mechanics: This is joint work with Franceso Maggi.

Extremal combinatorics for sparse (pseudo)random structures

Series
Combinatorics Seminar
Time
Friday, November 1, 2013 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Hiep HanEmory University and University of Sao Paulo
The problem of extending results in extremal combinatorics to sparse random and pseudorandom structures has attracted the attention of many researchers in the last decades. The breakthroughs due to several groups in the last few years have led to a better understanding of the subject, however, many questions remain unsolved. After a short introduction into this field we shall focus on some results in extremal (hyper)graph theory and additive combinatorics. Along the way some open problems will be given.

Clustering under Perturbation Resilience

Series
ACO Student Seminar
Time
Friday, November 1, 2013 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Yingyu LiangCollege of Computing, Georgia Tech
Recently, Bilu and Linial formalized an implicit assumption often made when choosing a clustering objective: that the optimum clustering to the objective should be preserved under small multiplicative perturbations to distances between points. They showed that for max-cut clustering it is possible to circumvent NP-hardness and obtain polynomial-time algorithms for instances resilient to large (factor O(\sqrt{n})) perturbations, and subsequently Awasthi et al. considered center-based objectives, giving algorithms for instances resilient to O(1) factor perturbations. In this talk, for center-based objectives, we present an algorithm that can optimally cluster instances resilient to (1+\sqrt{2})-factor perturbations, solving an open problem of Awasthi et al. For k-median, a center-based objective of special interest, we additionally give algorithms for a more relaxed assumption in which we allow the optimal solution to change in a small fraction of the points after perturbation. We give the first bounds known for k-median under this more realistic and more general assumption. We also provide positive results for min-sum clustering which is a generally much harder objective than center-based objectives. Our algorithms are based on new linkage criteria that may be of independent interest.

Pages