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

Series: Research Horizons Seminar

This talk will traverse several topics in singularity
theory, algebraic analysis, complex analysis, algebraic geometry, and
statistics. I will outline effective methods to compute the log
canonical threshold, a birational invariant of an algebraic variety,
as well as its potential statistical applications.

Series: Research Horizons Seminar

I will present a construction of a non-measurable set using the fundamental
fact that a graph with no odd cycles is 2-colorable. That will not take very
long, even though I will prove everything from first principles. In the rest
of the time I will discuss the Axiom of Choice and some unprovable
statements. The talk should be accessible to undergraduates.

Series: Research Horizons Seminar

Following exciting developments in the continuous setting of manifolds (and
other geodesic spaces), in joint works with various collaborators, I have
explored discrete analogs of the interconnection between several functional
and isoperimetric inequalities in discrete spaces. Such inequalities include
concentration, transportation, modified versions of the logarithmic Sobolev
inequality, and (most recently) displacement convexity. I will attempt to
motivate and review some of these connections and illustrate with examples.
Time permitting, computational aspects of the underlying functional
constants and other open problems will also be mentioned.

Series: Research Horizons Seminar

To any self-map of a surface we can associate a real number, called the
entropy. This number measures, among other things, the amount of mixing
being effected on the surface. As one example, you can think about a taffy
pulling machine, and ask how efficiently the machine is stretching the
taffy. Using Thurston's notion of a train track, it is actually possible to
compute these entropies, and in fact, this is quite easy in practice. We
will start from the basic definitions and proceed to give an overview of
Thurston's theory. This talk will be accessible to graduate students and
advanced undergraduates.

Series: Research Horizons Seminar

In this talk I will survey some recent results related to
Roth's Theorem on three-term arithmetic progressions. The basic
problem in this area is to determine the largest subset S of the
integers in {1,...,n} containing no triple of the form x, x+d, x+2d.
Roth showed back in the 1950's that the largest such set S has size
o(n), and over the following decades his result has been
considerably improved upon.

Series: Research Horizons Seminar

It is well known that typically equations do not have analytic (expressed by formulas) solutions. Therefore a classical approach to the analysis of dynamical systems (from abstract areas of Math, e.g. the Number theory to Applied Math.) is to study their asymptotic (when an independent variable, "time", tends to infinity) behavior. Recently, quite surprisingly, it was demonstrated a possibility to study rigorously (at least some) interesting finite time properties of dynamical systems. Most of already obtained results are surprising, although rigorously proven. Possible PhD topics range from understanding these (already proven!) surprises and finding (and proving) new ones to numerical investigation of some systems/models in various areas of Math and applications, notably for dynamical analysis of dynamical networks. I'll present some visual examples, formulate some results and explain them (when I know how).

Series: Research Horizons Seminar

A polytope is a convex hull of a finite set of points in a vector space. The set of polytopes in a fixed vector space generate an algebra where addition is formal and multiplication is the Minkowski sum, modulo some relations. The algebra of polytopes were used to solve some variations of Hilbert's third problem about subdivision of polytopes and to give a combinatorial proof of Stanley's g-Theorem that characterizes face numbers of simplicial polytopes. In this talk, we will introduce McMullen's version of polytope algebra and show that it is isomorphic to the algebra of tropical cycles which are balanced weighted polyhedral fans. The tropical cycles can be used to do explicit computations and examples in polytope algebra.

Series: Research Horizons Seminar

I will discuss the theory of chip-firing games, focusing on the interplay between chip-firing games and potential theory on graphs. To motivate the discussion, I will give a new proof of "the pentagon game". I will discuss the concept of reduced divisors and various related algorithmic aspects of the theory. If time permits I will also give some applications, including an "efficient bijective" proof of Kirchhoff's matrix-tree theorem.

Series: Research Horizons Seminar

We will discuss the discrete Schroedinger problem on the integer line and on graphs. Starting from the definition of the discrete Laplacian on the integer line, I will explain why the problem is interesting, how the discrete case relates to the continuous case, and what the open problems are. Recent results by the speaker (joint with Evans Harrell) will be presented.The talk will be accessible to anyone who knows arithmetic and matrix multiplications.

Series: Research Horizons Seminar

I will give a brief introduction to the theory ofviscosity solutions of second order PDE. In particular, I will discussHamilton-Jacobi-Bellman-Isaacs equations and their connections withstochastic optimal control and stochastic differentialgames problems. I will also present extensions of viscositysolutions to integro-PDE.