Masoud Kamgarpour
Towards reductive generalisations of Kac’s polynomials abstract
Abstract:
In 1980 Victor Kac proved that the number of indecomposable representations of a quiver over a finite field is a polynomial.The desire to understand this polynomial has been a key driving force in geometric representation theory, cf. Schiffmann’s 2018 ICM. Quiver varieties are by construction type A objects, i.e. attached to the group GL_n. In this talk we explore what the reductive analogue of Kac polynomials can be. We restrict to certain quivers that are called star shaped quivers. Here a theorem of Hausel, Letellier and Villegas relates Kac’s polynomial to the number of points of moduli of representations of connections on vector bundles on surfaces. Replacing vector bundles by G-bundles allows us to explore the G-analogues of Kac’s polynomials. This talk is based on the arXiv preprint: https://arxiv.org/abs/2409.04735
10:15 • EPF Lausanne, CM 1 100
Anders Karlsson (University of Geneva)
Abstract:
A new fixed-point theorem will be explained asserting that every isometry of a metric space has a fixed-point in the metric compactification of (the injective hull of) the space. In case the metric space admits a conical bicombing there is no need for passing to the injective hull, examples of such spaces include all Banach spaces, CAT(0)-spaces, injective metric spaces, spaces of positive operators, as well as convex subsets and products thereof. The central notion is that of a metric functional which is an extension of Busemann’s and Gromov’s horofunctions. The result is in particular new for infinite-dimensional Banach spaces and non-proper CAT(0)-spaces. As a consequence, well-known fixed-point free examples get their fixed-point as it were. A new mean ergodic theorem generalizing von Neumann’s is another direct consequence. A more elaborate corollary is that every invertible bounded linear operator of a Hilbert space admits a non-trivial invariant metric functional on the symmetric space of positive operators.
Dr. Sam Canning (ETH Zürich)
Cycles on moduli spaces of curves and abelian varieties abstract
Abstract:
I will show how the study of non-tautological classes on the moduli space of abelian varieties helps explain the structure of the tautological ring of the moduli space of curves of compact type. On the curves side, this is joint work with Hannah Larson and Johannes Schmitt, and on the abelian varieties side, it is joint with Dragos Oprea and Rahul Pandharipande.
13:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G G43
Blerim Alimehaj
\\(b\\)-Symbol Weight Distribution of Irreducible Cyclic Codes abstract
Abstract:
As our technology advances, the need for \\(b\\)-symbol read channels that can handle messages with high-density data becomes crucial. The problem with conventional read channels is that they are more likely to overlap multiple information units, also called symbols, while reading messages with high-density data. The idea behind \\(b\\)-symbol read channels is that these channels consider all \\(b\\) consecutive symbols from the sent message as one symbol. This protects the message from being read with overlapping symbols. Considering a code word of some code \\(\\mathcal{C}\\) as the sent message, the message read by some \\(b\\)-symbol read channel is called a \\(b\\)-symbol code word. In this thesis, we investigate \\(b\\)-symbol codes over semiprimitive irreducible cyclic codes and their Hamming weight distribution. The \\(b\\)-symbol Hamming weight distribution of semiprimitive irreducible cyclic codes is determined up to an invariant that we call \\(\\mu(b)\\) and \\(\\mu_l (b)\\). These invariants depend on \\(b\\) and on the choice of the primitive element that we use to describe the irreducible cyclic code\\(\\mathcal{C}\\). This thesis aims to find lower and upper bounds of the average values of these invariants. To do so, we use algebraic function field theory and number theory. In this thesis, we obtain several lower and upper bounds, test their performance for smaller fields, and compare them. Furthermore, we are able to improve those bounds due to a number theoretic approach. Using these bounds, we are able to deduce a very good estimate for the average values of the invariants \\(\\mu(b)\\) resp. \\(\\mu_l (b)\\). These results provide a better understanding of the \\(b\\)-symbol Hamming weight distribution of semiprimitive irreducible cyclic codes.
15:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 28
Andrew Lobb (Durham University, UK)
Symplectic geometry and peg problems abstract
Abstract:
The Square Peg Problem (SPP), formulated by Toeplitz in 1911 and still unsolved, asks whether every Jordan curve contains four points at the vertices of a square. We shall discuss how, when the Jordan curve is smooth, SPP and related peg problems can be interpreted as questions in symplectic geometry, and deduce some consequences both for smooth curves and for other classes. Joint work with Josh Greene.
15:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Ilya Chevyrev (TU Berlin and University of Edinburgh)
Large field problem for SPDEs by scaling abstract
Abstract:
In this talk, I will show a simple approach to deriving a priori bounds for coercive SPDEs based on scaling. The basic idea is that one first shows bounds for the equation with a small noise and then "rescales" the bounds back to a global scale. Although many equations that the approach can handle have been treated recently with other methods, the advantages of the approach by scaling is that it is quite simple and allows one to state a single result that simultaneously covers different equations, such as ODEs and parabolic PDEs. Based on work in progress with Massimiliano Gubinelli.
16:00 • EPF Lausanne, CM 1 517
Luana Kurmann
Cayley Graphs with Large Girth and Constructions of LDPC Codes abstract
Abstract:
In this talk, we investigate a particular family of graphs with large girth and look at their applications to low-density parity-check (LDPC) codes. Specifically, we study a family of Cayley graphs with large girth over finite fields with prime order, constructed by Margulis. We analyse Margulis' lower bound for the girth of these graphs and compute the exact girth for several prime numbers. Our results show that the actual girth exceeds the bound by an average of about 87% in all cases studied. We show an improvement to Margulis' bound which leads to an average error rate of about 56%. Additionally, we present further observations which suggest that an even better bound may still exist. Furthermore, we show how LDPC codes can be constructed based on these graphs and simulate their error correction performance over an additive white Gaussian noise channel.
16:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 28
Prof. Dr. Dirk Pauly (TU Dresden)
Traces for Hilbert Complexes abstract
Abstract:
We study a new notion of trace and extension operators for abstract Hilbert complexes.
16:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 19.2
Michel Devoret (University of California Santa Barbara)
The Physics of Information abstract
Abstract:
It is often said that we live in an "information society". But what exactly is meant by information? A sequence of symbols 0 and 1? Currently, inside the most miniaturized computer, a binary digit, commonly called a bit, is a complex physical device with billions of interacting particles. What happens to information processing when each bit is carried by a single quantum particle, such as an atom, an electron or a photon? Conversely, can we see the movement of elementary particles as a calculation that the universe is performing? The physics of the last thirty years has been particularly rich in the development of ideas and experiments that have illustrated the crucial role of information in physical laws. A new type of computer, the quantum computer, still in the prototype phase, has been invented. This lecture, which is aimed at non-specialists, will explain the merits of such quantum machine and some of the questions it can tackle. In particular, one crucial aspect of its development, namely the progress in fault-tolerant operations, will be discussed.
17:00 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room F 30
Dr. Dirk Zeindler (Lancaster University)
Partitions into semi-primes abstract
Abstract:
In this talk we will look at some recent developments about integer partitions, including coloured partitions, semi-prime partitions and r-prime partitions.We will give asymptotic formulae for the number of these partitions. We will also look at some interesting elements of the proof of these formulae, without going into too much technical detail.In particular, we have a look at strange and pseudo-differentiable functions.
17:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43