Events
This week
×
Modal title
Modal content
Monday, 28 October | |||
---|---|---|---|
Time | Speaker | Title | Location |
13:30 - 14:30 |
Piero Grassi Università del Piemonte Orientale |
Abstract
We illustrate the construction of quantum field theories on supermanifolds and
we provide a complete Cartan-calculus to deal with superdiffeomorphisms in curved space.
We will briefly review the geometry of supermanifolds and we discuss the challenges related to
quantum field theory applications.
Talks in Mathematical PhysicsQuantum Field Theories on Supermanifoldsread_more |
Y27 H 25 |
15:15 - 16:30 |
Adi Dickstein Tel-Aviv University |
Abstract
In various areas of mathematics there exist "big fiber theorems", these are theorems of the following type: "For any map in a certain class, there exists a 'big' fiber", where the class of maps and the notion of size changes from case to case.
We will discuss three examples of such theorems, coming from combinatorics, topology and symplectic topology from a unified viewpoint provided by Gromov's notion of ideal-valued measures.
We adapt the latter notion to the realm of symplectic topology, using an enhancement of Varolgunes’ relative symplectic cohomology to include cohomology of pairs. This allows us to prove symplectic analogues for the first two theorems, yielding new symplectic rigidity results.
Necessary preliminaries will be explained.
The talk is based on a joint work with Yaniv Ganor, Leonid Polterovich and Frol Zapolsky.
Symplectic Geometry SeminarSymplectic topology and ideal-valued measures read_more |
HG G 43 |
Tuesday, 29 October | |||
---|---|---|---|
Time | Speaker | Title | Location |
14:15 - 15:15 |
Lucas Pesenticall_made Bocconi University, IT |
Abstract
We study a broad class of nonlinear iterative algorithms applied to random matrices, including power iteration, belief propagation, approximate message passing, and various forms of gradient descent. We show that the behavior of these algorithms can be analyzed by expanding their iterates in an appropriate basis of polynomials, which we call the Fourier diagram basis. As the dimension of the input grows, this basis simplifies to the tree-shaped diagrams, that form a family of asymptotically independent Gaussian vectors. Moreover, the dynamics of the iteration restricted to the tree diagrams exhibit properties reminiscent of the assumptions of the cavity method from statistical physics. This enables us to "implement" heuristic cavity-based reasoning into rigorous arguments, including a new simple proof of the state evolution formula. Based on joint work with Chris Jones (https://arxiv.org/abs/2404.07881)
DACO SeminarUnderstanding iterative algorithms with Fourier diagramsread_more |
HG G 19.1 |
15:15 - 16:15 |
Dr. Laura Prat |
Abstract
The talk will be about removable singularities for solutions of the Heat Equation and the Fractional Heat Equation in time varying domains.
In order to talk about removability, some associated capacities will be introduced to study its metric and geometric properties.
I will discuss onsome results obtained in joint work with X. Tolsa and J. Mateu and also mention some recent achievements with J. Hernández.
Analysis SeminarRemovable singularities for solutions of the Heat equation and the fractional Heat equation in time varying domainsread_more |
HG G 43 |
16:30 - 17:30 |
Beatrice Toesca di Castellazzo Universität Zürich |
Abstract
Suppose you want to send a message to your friend. Can errors occur during the transmission? Unfortunately yes. It is then crucial to find ways to detect errors in the received message and possibly correct it. The goal of algebraic coding theory is to design ways of encoding messages (vectors over a finite field) with an algebraic structure that guarantees that, with a limited number of errors, the meaning of the original message is not compromised. In multi-cast communication, as in the streaming of data over the Internet, one deals with sending information to multiple receivers across a network with several intermediate nodes. To improve the network throughput, a coding technique called random linear network coding was developed. In this scenario, the intermediate nodes transmit a random linear combination of the vectors received. With this technique, it is possible to asymptotically achieve the maximum capacity of the network, without relying on its topology. In this talk, we will start studying the basic notions of coding theory with only one sender and one receiver, and then switch to the case of data transmission over a network and explain how in this case giving the messages the structure of a linear subspace helps correcting errors.
Zurich Graduate ColloquiumWhat is... Network Coding?read_more |
KO2 F 150 |
Wednesday, 30 October | |||
---|---|---|---|
Time | Speaker | Title | Location |
13:30 - 14:30 |
Prof. Dr. François Maucourant Université Rennes I |
Abstract
We'll recall how to attach to a periodic geodesic of H^2/PSL(2,Z) an arithmetical quantity, its discriminant. After discussing how to pick a geodesic at random, we will show that 'most' geodesics have large discriminant when ordered by length, and that 42% of them have a fundamental discriminant.
Ergodic theory and dynamical systems seminarDiscriminants of periodic geodesics on the modular surfaceread_more |
Y27 H 28 |
13:30 - 15:00 |
Lycka Drakengren ETH Zürich |
Abstract
The Torelli morphism and its extension to the moduli space of stable curves
Algebraic Geometry and Moduli SeminarComplex abelian varieties and their moduli VIread_more |
HG G 43 |
17:15 - 18:45 |
Prof. Dr. Jean Bertoin Universität Zürich, Switzerland |
Y27 H26 |
Thursday, 31 October | |||
---|---|---|---|
Time | Speaker | Title | Location |
16:15 - 17:15 |
Layne Hall University of Warwick |
Abstract
We will describe how a family of dynamical systems can be studied using combinatorial topology. The systems in question are pseudo-Anosov flows, an abundant class of continuous dynamical systems on three-manifolds. The combinatorics comes from an object of a different flavour: veering triangulations. Both of these objects, in their own right, are closely related to the geometry and topology of the underlying manifold. We will start by introducing pseudo-Anosov flows and veering triangulations. Then, we will discuss a deep correspondence between the two.
Geometry Graduate ColloquiumThe correspondence between pseudo-Anosov flows and veering triangulations.read_more |
HG G 19.2 |
16:15 - 18:00 |
Joscha Henheik IST Austria |
Abstract
In nature one finds superconductors of varying critical temperatures and energy gaps. For weak superconductors, where the critical temperature is small, a universal phenomenon occurs: The ratio of the energy gap and critical temperature is a universal value, independent of the specific superconductor. I will present recent work on such universal phenomena in the BCS theory of superconductivity. Based on joint works with A. B. Lauritsen and B. Roos.
PDE and Mathematical PhysicsUniversalities in BCS theoryread_more |
HG F 26.1 |
Friday, 1 November | |||
---|---|---|---|
Time | Speaker | Title | Location |
14:15 - 15:15 |
Tim Gehrungercall_made ETH Zurich, Switzerland |
HG G 43 |
|
16:00 - 17:30 |
Prof. Dr. Peter Patzt Univ. of Oklahoma |
Abstract
I want to give a survey about the rational cohomology of SL_n Z. This includes recent developments of finding Hopf algebras in the direct sum of all cohomology groups of SL_n Z for all n. I will give a quick overview about Hopf algebras and what this structure implies for the cohomology of SL_n Z. If time permits, I will explain a connection to graph homology.
Algebraic Geometry and Moduli SeminarUnstable cohomology of SL(n,Z) and Hopf algebrasread_more |
HG G 43 |