Seminars Sorted by Series
Members’ Seminar
2:00pm|no seminar - Presidents’ Day
Positive geometries are real semialgebraic sets inside complex
varieties characterized by the existence of a meromorphic top-form
called the canonical form. The defining property of positive
geometries and their canonical forms is that the residue...
No seminar (workshop)
2:00pm|No seminar (workshop)
Geometry of 2-dimensional Riemannian disks and spheres.
I will discuss some geometric inequalities that hold on
Riemannian 2-disks and 2-spheres.
For example, I will prove that on any Riemannian 2-sphere there M
exist at least three simple periodic geodesics of length at most
20d, where d is the...
Tracking trajectories in Hamiltonian systems using holomorphic curve tools.
The goal is to describe how techniques from symplectic dynamics
can be used to study orbit travel in three dimensions, for systems
like the restricted 3-body problem from celestial mechanics. The
pseudo-holomorphic curve theory initiated by Hofer...
Amie Wilkinson
In the early 1930's, the Ergodic theorems of von Neumann and
Birkhoff put Boltzmann's Ergodic Hypothesis in mathematical terms,
and the natural question was born: is ergodicity the "general case"
among conservative dynamical systems? Oxtoby and Ulam...
A recent perspective on invariant theory
Invariant theory is a fundamental subject in mathematics, and is
potentially applicable whenever there is symmetry at hand (group
actions). In recent years, new problems and conjectures inspired by
complexity have come to light. In this talk, I will...
Etale and crystalline companions
Deligne's "Weil II" paper includes a far-reaching conjecture to
the effect that for a smooth variety on a finite field of
characteristic p, for any prime l distinct from p, l-adic
representations of the etale fundamental group do not occur
in...
2:00pm|no seminar - postdoc short talks
2:00pm|no seminar - postdoc short talks
Logarithmic concavity of Schur polynomials
Schur polynomials are the characters of finite-dimensional
irreducible representations of the general linear group. We will
discuss both continuous and discrete concavity property of Schur
polynomials. There will be one theorem and eight conjectures...
Finding structure in high dimensional data, methods and fundamental limitations
A fundamental task in (unsupervised) analysis of data is to
detect and estimate interesting "structure" hidden in it. In low
dimensions, this task has been explored for over 100 years with
dozens of developed methods. In this talk I'll focus on...
Length and volume in symplectic geometry
Daniel Cristofaro-Gardiner
Symplectic capacities are measurements of symplectic size. They
are often defined as the lengths of certain periodic trajectories
of dynamical systems, and so they connect symplectic embedding
problems with dynamics. I will explain joint work...
Sparse matrices in sparse analysis
In this talk, I will give two vignettes on the theme of sparse
matrices in sparse analysis. The first vignette covers work from
compressive sensing in which we want to design sparse matrices
(i.e., matrices with few non-zero entries) that we use to...
Pseudoholomorphic curves with boundary: Can you count them? Can you really?
Open Gromov-Witten (OGW) invariants should count
pseudoholomorphic maps from curves with boundary to a symplectic
manifold, with various constraints on boundary and interior marked
points. The presence of boundary poses an obstacle to invariance.
In...
Lie algebras and homotopy theory
In this talk, I'll discuss the role that Lie algebras play in
algebraic topology and motivate the development of a "homotopy
coherent" version of the theory. I'll also explain an
"equation-free" formulation of the classical theory of Lie
algebras...
2:00pm|No Seminar - Weyl Lectures
Convergence of nearest neighbor classification
The "nearest neighbor (NN) classifier" labels a new data
instance by taking a majority vote over the k most similar
instances seen in the past. With an appropriate setting of k, it is
capable of modeling arbitrary decision rules. Traditional...
Mathematical models of human memory
Human memory is a multi-staged phenomenon of extreme complexity,
which results in highly unpredictable behavior in real-life
situations. Psychologists developed classical paradigms for
studying memory in the lab, which produce easily
quantifiable...
The h-principle in symplectic geometry
Symplectic geometry, and its close relative contact geometry,
are geometries closely tied to complex geometry, smooth topology,
and mathematical physics. The h-principle is a general method used
for construction of smooth geometric objects...
Knotted 3-balls in the 4-sphere
We give the first examples of codimension-1 knotting in the
4-sphere, i.e. there is a 3-ball B1 with boundary the standard
linear 2-sphere, which is not isotopic rel boundary to the standard
linear 3-ball B0. Actually, there is an infinite family of...
Coarse dynamics and partially hyperbolic diffeomorphisms in 3-manifolds
The purpose of this talk is to introduce the classification
problem of partially hyperbolic diffeomorphisms in dimension 3
(including introducing the concept of partially hyperbolic
diffeomorphisms and its relevance). The main goal will be to...
Spectra of metric graphs and crystalline measures
The geometric optics trace formula gives the singular support of
wave trace on a compact Riemannian manifold. In the case of of a
one dimensional singular manifold, that is a metric (or quantum)
graph, this formula is exact and yields a crystalline...
Direct and dual Information Bottleneck frameworks for Deep Learning
Tali Tishby
The Information Bottleneck (IB) is an information theoretic
framework for optimal representation learning. It stems from the
problem of finding minimal sufficient statistics in supervised
learning, but has insightful implications for Deep Learning...
Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers
In this talk I will discuss the Sunflower Lemma and similar
lemmas that prove (in various contexts) that a set/distribution can
be partitioned into a structured part and a "random-looking" part.
I will introduce communication complexity as a key...
Towards a mathematical model of the brain
Striving to make contact with mathematics and to be consistent
with neuroanatomy at the same time, I propose an idealized picture
of the cerebral cortex consisting of a hierarchical network of
brain regions each further subdivided into...
The Palais-Smale Theorem and the Solution of Hilbert’s 23 Problem
2:00pm|http://theias.zoom.us/j/119412864
Hilbert’s 23rd Problem is the last in his famous list of
problems and is of a different character than the others. The
description is several pages, and basically says that the calculus
of variations is a subject which needs development. We will...
How to diagonalize a functor
2:00pm|Simonyi Hall 101 and Remote Access
Diagonalization is incredibly important in every field of
mathematics. I am a representation theorist, so I will start by
motivating the uses of diagonalization in representation theory.
Then comes a brief introduction to categorical
representation...
Stability, non-approximated groups and high-dimensional expanders
2:00pm|Simonyi Hall 101 and Remote Access
Several well-known open questions, such as: "are all groups
sofic or hyperlinear?", have a common form: can all groups be
approximated by asymptotic homomorphisms into the symmetric groups
$Sym(n)$ (in the sofic case) or the unitary groups $U(n)$...
Log-concavity, matroids and expanders
2:00pm|Simonyi Hall 101 and Remote Access
Matroids are combinatorial objects that model various types of
independence. They appear several fields mathematics, including
graph theory, combinatorial optimization, and algebraic geometry.
In this talk, I will introduce the theory of matroids...
2:00pm|Simonyi Hall 101 and Remote Access
You can make a paper Moebius band by starting with a $1$ by $L$
rectangle, giving it a twist, and then gluing the ends together.
The question is: How short can you make $L$ and still succeed in
making the thing? This question goes back to B. Halpern...
Metric embeddings, uniform rectifiability, and the Sparsest Cut problem
2:00pm|Simonyi Hall 101 and Remote Access
(joint work with Assaf Naor) A key problem in metric geometry
asks: given metric spaces $X$ and $Y$, how well does $X$ embed in
$Y$? In this talk, we will consider this problem for the case of
the Heisenberg group and explain its connections to...
Some analogies between arithmetic and topology
2:00pm|Simonyi Hall 101 and Remote Access
There are striking analogies between topology and arithmetic
algebraic geometry, which studies the behavior of solutions to
polynomial equations in arithmetic rings. One expression of these
analogies is through the theory of etale cohomology, which...
2:00pm|Simonyi Hall 101 and Remote Access
Growth, isoperimetry and Liouville property for random walks on groups
2:00pm|Simonyi Hall 101 and Remote Access
In a joint work with Tianyi Zheng we show that the growth
function of the first Grigorchuk group satisfies \[ \ln \ln v_n/\ln
v_n = a, \] where $a = \log 2/\log x$, $x$ being a positive root of
the polynomial $x^3-x^2-2x-4$. This is done by...
Support Varieties for Modular Representations
2:00pm|Simonyi Hall 101 and Remote Access
We present an overview of elementary methods to study extensions
of modular representations of various types of "groups". We shall
begin by discussing actions of an elementary abelian $p$-group, $E
= (Z/p)^r$, on finite dimensional vector spaces...
NP-hard problems naturally arising in knot theory
2:00pm|Simonyi Hall 101 and Remote Access
Low-dimensional topology and geometry have many problems with an
easy formulation, but a hard solution. Despite our intuitive
feeling that these problems are "hard", lower or upper bounds on
algorithmic complexity are known only for some of them...
A Feynman Approach to Dynamic Rate Markov Processes
2:00pm|Simonyi Hall 101 and Remote Access
Physics inspired mathematics helps us understand the random
evolution of Markov processes. For example, the Kolmogorov forward
and backward differential equations that govern the dynamics of
Markov transition probabilities are analogous to the...
2:00pm|Simonyi Hall 101 and Remote Access
2:00pm|Simonyi Hall 101 and Remote Access
A nonabelian Brunn-Minkowski inequality
2:00pm|Simonyi Hall 101 and Remote Access
The celebrated Brunn-Minkowski inequality states that for
compact subsets $X$ and $Y$ of $\Bbb{R}^d$, $m(X+Y)^{1/d} \geq
m(X)^{1/d}+m(Y)^{1/d}$ where $m(\cdot)$ is the Lebesgue measure. We
will introduce a conjecture generalizing this inequality to...
The top-heavy conjecture for vectors and matroids
2:00pm|Simonyi Hall 101 and Remote Access
A 1948 theorem of de Bruijn and Erdős says that if $n$ points in
a projective plane do not lie all on a line, then they determine at
least n lines. More generally, Dowling and Wilson conjectured in
1974 that for any finite set of vectors spanning a...
No seminar: Presidents' Day
2:00pm|Simonyi Hall 101 and Remote Access
Astrophysical fluid dynamics
2:00pm|Simonyi Hall 101 and Remote Access
Most of the visible matter in the Universe is a plasma, that is
a dilute gas of ions, electrons, and neutral atoms. In many
circumstances, the dynamics of this plasma can be modeled in the
continuum limit, using the equations of fluid mechanics...
The Value of Errors in Proofs
2:00pm|Simonyi Hall 101 and Remote Access
A few months ago, a group of theoretical computer scientists
posted a paper on the Arxiv with the strange-looking title "MIP* =
RE", impacting and surprising not only complexity theory but also
some areas of math and physics. Specifically, it...