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 and
C...
We introduce two new notions for polynomials associated with
discrete set-valued probability distributions. These notions
generalize well-studied properties like real-stability and
log-concavity, but unlike them robustly degrade under a number
of...
We first describe mathematical foundation of DSGRN (Dynamic
Signatures Generated by Regulatory Networks), an approach that
provides a queryable description of global dynamics of a network
over its entire param- eter space. We describe a connection...
Viterbo conjectured that a normalized symplectic capacity, on
convex domains of a given volume, is maximized for the ball. A
stronger version of this conjecture asserts that all normalized
symplectic capacities agree on convex domains. Since...
A classical result identifies holomorphic modular forms with
highest weight vectors of certain representations of SL2(ℝ). We
study locally analytic vectors of the (p-adically) completed
cohomology of modular curves and prove a p-adic analogue of...
This is the second talk in a series of three talks on the
derived Satake. I will give an overview of an article by Ginzburg
which laid the foundational ideas for this equivalence.
In this talk we survey the recent connection (a joint work with
Becker and Lubotzky) between certain group theoretic notions
related to stability, and a novel class of problems from the realm
of property testing. Consider the computational
problem...
In this talk we survey the recent connection (a joint work with
Becker and Lubotzky) between certain group theoretic notions
related to stability, and a novel class of problems from the realm
of property testing. Consider the computational
problem...
We will talk about a recent result of Jeff Kahn, Bhargav
Narayanan, and myself stating that the threshold for the random
graph G(n,p) to contain the square of a Hamilton cycle is 1/sqrt n,
resolving a conjecture of Kühn and Osthus from 2012. For...
