Given two Hamiltonian isotopic curves in a surface, one would like to tell whether they are "close" or "far apart". A natural way to do that is to consider Hofer's metric which computes mechanical energy needed to deform one curve into the other. However due to lack of tools the large-scale Hofer geometry is only partially understood. On some surfaces (e.g. S^2) literally nothing is known.
Title:
Path integral representations for magnetic Schroedinger operators on graphs
Abstract:
We consider the semigroup and the unitary group of magnetic Schrödinger operators on graphs. Using the ideas of the Feynman Kac formula, we develop a representation of the semigroup and the unitary group in terms of the stochastic process associated with the free Laplacian. As a consequence we derive Kato-Simon estimates for the unitary group. This is joint work with Batu Güneysu (Bonn).
Abstract: We answer the following questions:
1. Consider a Borel set $X \subset \R^N$ equipped with a probability measure $\mu$. For fixed $k
2. Can one prove a probabilistic version of Takens delay-embedding theorem with less observations?
3. Is metric mean dimension related to analog compression?
Based on joint works with Krzysztof Barański and Adam Śpiewak.
Title: The Modal Logic of Forcing (Part III)
Abstract: Modal logic is used to study various modalities, i.e. various ways in which statements can be true, the most notable of which are the modalities of necessity and possibility. In set-theory, a natural interpretation is to consider a statement as necessary if it holds in any forcing extension of the world, and possible if it holds in some forcing extension. One can now ask what are the modal principles which captures this interpretation, or in other words - what is the "Modal Logic of Forcing"?
Abstract: In this talk we will discuss some recent work by Guihéneuf and Lefeuvre who prove that shadowing is generic for Lebesgue measure preserving transformations of the 2-torus. We will spend most of our time motivating the problem, discussing the history of such questions- specifically touching upon earlier work of Oxtoby, Ulam, Alpern and Prasad and some general techniques used in the area. Time permitting, we will discuss the recent proof given by Guihéneuf and Lefeuvre.
I will review homological mirror symmetry for the torus, which describes Lagrangian Floer theory on T^2 in terms of vector bundles on the Tate elliptic curve --- a version of Lekili and Perutz's works "over Z", where t is the Novikov parameter. Then I will describe a modified form of this story, joint with Lekili, where the Floer theory is altered by a locally constant sheaf of rings on T^2 (an "F-field").
Title: Interpolation sets and arithmetic progressions
Abstract: Given a set S of positive measure on the unit circle, a set of integers K is an interpolation set (IS) for S if for any data {c(k)} in l^2(K) there exists a function f in L^2(S) such that its Fourier coefficients satisfy f^(k)=c(k) for all k in K.
In the talk I will discuss the relationship between the concept of IS and the existence arithmetic structure in the set K, I will focus primarily on the case where K contains arbitrarily long arithmetic progressions with specified lengths and step sizes.
Abstract: Substitution schemes provide a classical method for constructing tilings
of Euclidean space. Allowing multiple scales in the scheme, we introduce
a rich family of sequences of tile partitions generated by the substitution
rule, which include the sequence of partitions of the unit interval
considered by Kakutani as a special case. In this talk we will use new path counting
results for directed weighted graphs to show that such sequences
of partitions are uniformly distributed, thus extending Kakutani's
The general theme is game dynamics leading to equilibrium concepts.
The plan is to deal with the following topics (all concepts will be defined, and proofs / proof outlines will be provided):
(1) An integral approach to the construction of calibrated forecasts and their use for Nash equilibrium dynamics.
(2) Blackwell's Approachability Theorem and its use for correlated equilibrium dynamics (regret-matching).
(3) Communication complexity and its use for the speed of convergence of uncoupled dynamics.
Quantum computation
==================
You can hardly open the newspaper nowadays without seeing something about Quantum computation. But aside from the hype and the industry interest, this deceivingly simple model offers a surprisingly rich set of mathematical, physical and conceptual questions, which seem to touch upon almost any area of mathematics: from group representations, to Markov chains, Knot invariants, expanders, cryptography, lattices, differential geometry, and many more.
