Past Seminars

Printer-friendly version
  • Danny Nguyen
    Thu Mar 1, 2018
    3:00 pm
    Short generating functions were first introduced by Barvinok to enumerate integer points in polyhedra. Adding in Boolean operations and projection, they form a whole complexity hierarchy with interesting structure. We study them in the computational complexity point of view. Assuming standard complexity assumption, we show that these functions...
  • Adam Jacob
    Tue Feb 27, 2018
    4:00 pm
    The study of tangent cones in geometric analysis is an important tool in understanding the structure at a singular point of a geometric equation. In this talk I will discuss how to uniquely identify the tangent cone of a Yang-Mills connection with isolated singularity in the complex setting, given an initial assumption on the complex structure of...
  • Bigyuan Liu
    Tue Feb 27, 2018
    3:00 pm
    In this talk, we discuss the Diederich–Fornæss index in several complex variables. A domain Ω ⊂ Cn is said to be pseudoconvex if −log(−δ(z)) is plurisubharmonic in Ω, where δ is a signed distance function of Ω. The Diederich–Fornæss index has been introduced since 1977 as an...
  • Ian Charlesworth
    Tue Feb 27, 2018
    11:00 am
    Free entropy theory is an analogue of information theory in a non-commutative setting, which has had great applications to the examination of structural properties of von Neumann algebras. I will discuss some ongoing joint work with Paul Skoufranis to extend this approach to the setting of bi-free probability which attempts to study simultaneously...
  • Ryan Sullivant
    Mon Feb 26, 2018
    4:00 pm
    In this talk, we will continue with basics of measurable cardinals and their relationship to non-trivial elementary embeddings.  We proceed with basic facts about the constructible universe, L.  After laying this groundwork, we show L cannot have a measurable cardinal.  Time permitting, we will discuss the dichotomy introduced by...
  • Jesse Wolfson
    Fri Feb 23, 2018
    4:00 pm
    Algebraic topology was invented by Poincare in 1895 to study the behavior of algebraic functions.  In his seminal ICM address 5 years later, Hilbert posed a fundamental challenge to the field: find a topological obstruction to reducing the solution of the general degree 7 polynomial to an expression in functions of two or fewer variables....
  • tba
    Milivoje Lukic
    Thu Feb 22, 2018
    2:00 pm