Pavel Safronov (University of Zurich)
Finite-dimensionality of skein modules abstract
Abstract:
In this talk I will explain what skein modules of 3-manifolds are and how they fit in the framework of topological field theory and factorization homology. I will also outline a proof that skein modules of closed 3-manifolds are finite-dimensional, proving a conjecture of Witten. This is joint work with Sam Gunningham and David Jordan
10:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 25
Prof. Dr. Ruth Kellerhals (Université de Fribourg)
Salem numbers and hyperbolic Coxeter groups abstract
Abstract:
I shall give a gentle introduction into the topic of (planar) hyperbolicCoxeter groups, their growth rates and connections to algebraic integerssuch as Salem numbers. Of particular interest are groups of small covolumeand/or Salem numbers of bounded degree. I would like to presentsome open questions and stimulate discussions.
10:20 • Université de Fribourg, Chemin du Musée 23, Lonza (Math II) seminar room
Ivan Fesenko (University of Nottingham)
Two-dimensional local fields and integration on them abstract
Abstract:
Two-dimensional local fields include formal loop objects such as $R((t))$, $C((t))$, $Q_p((t))$ and also fields such as $F_p((t_1))((t_2))$, $Q_p\\{\\{t\\}\\}$. They play the fundamental role in two-dimensional number theory, arithmetic geometry, representation theory, algebraic topology and math physics. I will explain basic things about such fields, including their unusual topology and the theory of measure and integration on such fields and Fourier transform which can be viewed as a (rigorous) arithmetic version of the Feynman integral. While one-dimensional local fields show up in tropical geometry of curves, one may expect that two-dimensional local fields should be involved in tropical geometry of surfaces.
11:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Paul Wedrich (Australian National University)
Invariants of 4-manifolds from Khovanov-Rozansky link homology abstract
Abstract:
Ribbon categories are 3-dimensional algebraic structures that control quantum link polynomials and that give rise to 3-manifold invariants known as skein modules. I will describe how to use Khovanov-Rozansky link homology, a categorification of the gl(N) quantum link polynomial, to obtain a 4-dimensional algebraic structure that gives rise to vector space-valued invariants of smooth 4-manifolds. The technical heart of this construction is the newly established functoriality of Khovanov-Rozansky homology in the 3-sphere.
13:00 • UZH Irchel, Building Y35, Room F 08a
Bill Duke (University of California, Los Angeles)
Topics in modern analytic number theory abstract
Abstract:
This series of lectures will treat a number of special topics all of which involve some aspect of the modular group SL(2,Z).
Many have as their natural starting point the class number formulas of Dirichlet for binary quadratic form or, equivalently, ideal classes of quadratic number fields. Most involve L-functions of various kinds and modular forms and their generalizations. These topics include:
New class number formulas, both for quadratic forms and higher degree forms, for example binary cubic form Properties of geometric objects associated to the modular group, including cm points, closed geodesics and infinite volume surfaces having closed geodesics as boundaries. The interaction between flat metrics and the hyperbolic metric, for instance the curvature of closed geodesics with respect to a flat metric. Quasimorphisms of the modular group and modular cocycles. Linking numbers of modular knots. Markov forms and modular billiards Connections with Diophantine approximation and the geometry of numbers.
I will attempt to provide enough background and historical context for each topic to make them accessible to non-experts, but hope to give enough "new" material to stimulate the interest of the experts as well. I will also give suggestions about areas for further research.
13:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Prof. Dr. Heide Gluesing-Luerssen (University of Kentucky)
On Sparseness of MRD codes and Semifields abstract
Abstract:
In this talk I will discuss the proportion of MRD codes within the space of all rank-metric codes of the same dimension. More specifically, I will consider the asymptotic behavior of this proportion as the field size tends to infinity. It turns out that, for instance, [3x2;2]-MRD codes have an asymptotic proportion of 1/3. On the other hand, for [3x3;3]-MRD codes this asymptotic proportion is zero, and therefore we call this class of MRD codes sparse. The proof of the sparsity follows from a parametrization of 3-dimensional semifields by Menichetti (1973). I will discuss the relation between MRD codes and semifields and present the main steps of the proof.
15:00 • Uni Neuchatel, B217
Steve Donkin (University of New York)
On the modular Clebsch-Gordan formula abstract
Abstract:
This is joint work with Samuel Martin. The irreducible finite dimensional modules for the complex Lie algebra sl(2) are labelled by the non-negative integers and these modules may be easily described via the action on the polynomial algebra in two variables (the components are the symmetric powers of the natural module).
The Clebsch-Gordan formula is a simple formula describing how the tensor product of two irreducible modules may be decomposed as sum of irreducible modules. It has uses in mathematical physics and invariant theory. Replacing the Lie algebra by the special linear group over an infinite field of positive characteristic one has the same parametrisation of the simple modules and the symmetric powers. It is natural to ask how the corresponding tensor products decompose. This was done for simple modules by Doty and Henke. It was done for the symmetric powers by Mikael Cavalin (in his Master\'s Thesis at EPFL). We shall discuss here the problem of decomposing the tensor product of a symmetric power and the dual of a symmetric power. Some special results were obtained by Oliver Goodbourn in the context of G complete reducibility. We give a general solution using the theory of tilting modules.
I will describe the background and classical results in the first 30 minutes and then go into more detail in positive characteristic in the remaining 40 minutes.
15:15 • EPF Lausanne, Salle GC A3 30
Allison Miller (Rice University, Houston)
Satellite operations and knot genera abstract
Abstract:
The classical 3-genus of knots behaves predictably under the satellite operation: a formula of Schubert states that a winding number w pattern P has g3(P(K))=g3(P)+|w|g3(K), for an appropriately defined g3(P) bounded below by g3(P(U)). In this talk, I’ll discuss the extent to which analogous formulae, particularly the intuition that the genus of P(K) should be roughly |w| times the genus of K, hold in the context of the slice genus. In the smooth setting the winding number continues to play a pivotal role, but in new joint work with Peter Feller and Juanita Pinz{‘o}n-Caicedo we give surprising evidence that in the topological category the winding number of a pattern is almost irrelevant in its effect on the 4-genus!
15:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Prof. Dr. Tom Graber (California Institute of Technology)
Log stable maps and double ramification cycles abstract
Abstract:
I will describe how the modified product of double ramification cycles defined by Holmes, Pixton, and Schmitt naturally arises in localization calculations on the space of log stable maps. This suggests the possibility of using localization methods to find explicit tautological formulas for these classes which is work in progress with Ranganathan, Pandharipande, and Zvonkine.
16:00 • ETH Zentrum, Building ITS, Room
Prof. Dr. Wolfgang Hackbusch (Max-Planck-Institut für Mathematik)
Computation of Best Exponential Sums Approximating 1/x in the Maximum Norm abstract
Abstract:
Exponential sums consist of the terms a_i*exp(-b_ix). Suchapproximations for the functions 1/x and 1/sqrt(x) are of particularinterest. We give examples of their use in quantum chemistry and tensorcalculus.The best approximation of 1/x with respect to the maximum norm istheoretically well understood, and rather sharp error estimates areknown. The error decays exponentially in the number of terms. Theoptimal exponential sum is characterised by the equioscillationproperty. The Remez algorithm is the standard method in the case ofpolynomial approximation.The existing literature about the numerical computation of the bestapproximation by exponential sums shows that all authors faced severenumerical difficulties. This may lead to the wrong impression that theproblem is illposed. In the lecture a stable method is described whichis used to compute best approximations for various parameters up to 57terms.Literature:W. Hackbusch: Computation of best L^{\\infty} exponential sums for 1/x byRemez\' algorithm. Comput. Vis. in Sci. (2019) 20:1-11
16:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room E 1.2
Miguel Angel Navarro Pérez (University of Alicante)
Optimal distance flag codes from spreads abstract
Abstract:
Flag codes are multishot subspace codes in which codewords are nested sequences of subspaces (flags). We focus on the family of flag codes attaining the maximum possible distance (optimal distance flag codes). In this talk, we characterize these codes, we determine when it is possible to construct optimal distance full flag codes from spreads and, whenever it is, we provide a specific construction and a decoding algorithm on the erasure channel.
16:15 • Uni Neuchatel, B217
Yuri Polyanskiy (MIT)
Communication Complexity of Estimating Correlations abstract
Abstract:
We characterize the communication complexity of the following distributed estimation problem. Alice and Bob observe infinitely many iid copies of $\\rho$-correlated unit-variance (Gaussian or binary) random variables, with unknown $\\rho\\in[-1,1]$. By interactively exchanging $k$ bits, Bob wants to produce an estimate $\\hat\\rho$ of $\\rho$. We show that the best possible performance (optimized over interaction protocol $\\Pi$ and estimator $\\hat \\rho$) satisfies $\\inf_{\\Pi \\hat\\rho}\\sup_\\rho \\mathbb{E} [|\\rho-\\hat\\rho|^2] = \\tfrac{1}{k} (\\frac{1}{2 \\ln 2} + o(1))$. Curiously, the number of samples in our achievability scheme is exponential in $k$; by contrast, a naive scheme exchanging $k$ samples achieves the same $\\Omega(1/k)$ rate but with a suboptimal prefactor. Our protocol achieving optimal performance is one-way (non-interactive). We also prove the $\\Omega(1/k)$ bound even when $\\rho$ is restricted to any small open sub-interval of $[-1,1]$ (i.e. a local minimax lower bound). Our proof techniques rely on symmetric strong data-processing inequalities and various tensorization techniques from information-theoretic interactive common-randomness extraction. Our results also imply an $\\Omega(n)$ lower bound on the information complexity of the Gap-Hamming problem, for which we show a direct information-theoretic proof.
16:15 • EPF Lausanne, Salle INF 211
Augusto Teixeira (IMPA)
Random walk on the simple symmetric exclusion process abstract
Abstract:
In this talk we will discuss some of the history of random walks on dynamical random environments and we will present a recent result where the environment is given by a simple symmetric exclusion process. For this model, we are able to prove a law of large numbers for the displacement of the walk (for all but two densities of the underlying particle system) as well as a central limit theorem throughout its ballistic regimes. The main technique that we employ is a renormalization scheme that brings its inspiration from percolation theory.
17:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43