Karin Baur (University of Leeds)
Cluster algebras and cluster categories via surfaces abstract
Abstract:
Twenty years of research in cluster theory have established deep links between cluster algebras, surface geometry and representation theory. Cluster structures can be defined using surface geometry, with curves corresponding to cluster variables and to rigid objects in associated categories. The classical Ptolemy relations give rise to exchange phenomena or mutation in the associated cluster structures.In these lectures I will focus on the geometric approach to cluster algebras and cluster categories. Topics discussed will include cluster structures on the Grassmannian, friezes, laminations, Postnikov diagrams, dimer models, root combinatorics.
10:15 • online
Michael Krivelevich (Tel Aviv University)
Random Graphs abstract
Abstract:
Random graphs is a generic name for discrete probability spaces, whose ground sets are composed of graphs, or more generally of discrete structures. Since its inception by Erdős and Rényi some sixty years ago, random graphs have grown to be one of the key disciplines in modern Combinatorics, at the same time serving as an indispensable tool for other branches of Combinatorics and Computer Science.The course will serve as an introduction to random graphs, covering classical topics as well as addressing recent developments and tools.Course syllabus (tentative): Models of random graphs and of random graph processes; illustrative examples; random regular graphs, configuration model; small subgraphs; long paths and Hamiltonicity; hitting time results; coloring problems; extremal problems in random graphs; pseudo-random graphs.Desirable background: Working knowledge of Graph Theory, familiarity with basic notions of Probability and Linear Algebra.
14:15 • Zoom
Onlline Seminar
Dr. Magali Bardet (University of Rouen (DIR))
eSeminar: Algebraic Attacks for solving the Rank Decoding and Minrank problems abstract
Abstract:<button>Video<i class="fa fa-play-circle"></button> (**This eSeminar will take place on Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact simran.tinani@math.uzh.ch **)
In this talk, I will present the recent improvements in algebraic techniques for solving the MinRank problem, which is ubiquitous in multivariate and rank metric code based cryptography. Algebraic attacks now outperform the combinatorial ones that were considered state of the art up until now. In the particular case of Fqm-linear codes in rank metric, for solving the Rank Decoding problem, the attack is even more efficient, and completely break the parameters of various schemes submitted to the NIST-PQC standardisation process for quantum-resistant public key cryptography.
15:00 • Onlline Seminar
Arkadij Bojko (Oxford University)
Wall-crossing for Hilbert schemes on CY 4-folds I abstract
Abstract:
Moduli schemes of coherent sheaves on CY 4-folds have a natural 3-term obstruction theory which leads to a definition of virtual fundamental classes. To study these, Joyce proposed a conjectural wall-crossing framework. We review the construction of vertex algebras which give rise to wall-crossing formulae of the virtual fundamental classes in the homology of the moduli stack of sheaves. We define a vertex algebra on the moduli stack of the auxiliary category of JS pairs and motivate their wall-crossing formula. Unlike the standard Behrend--Fantechi construction, the VFC depend on an additional piece of data called orientation. We review the recent results of existence oforientations and their compatibility under direct sums. They give rise to signs satisfying co-cycle conditions, necessary to define these vertex algebras.
15:00 • Zoom
Lewis Topley (University of Birmingham)
Abstract:
n a recent work Losev constructed a version of the orbit method for semisimple Lie algebras: this is a map from the set of coajoint orbits to the primitive spectrum of the enveloping algebra.For classical Lie algebras the map is known to be injective and Losev conjectured that the image should consist of primitive ideals obtained from one dimensional representations of W-algebras via Skryabin\'s equivalence.In this talk I will explain his construction, and my proof of this conjecture. One of the key steps is the use of Dirac reduction to obtain new presentations of the semiclassical limits of finite W-algebras.
zoom Passcode: 231451
15:00 • EPF Lausanne, Zoom Seminar
Prof. Dr. Mikko Salo (University of Jyväskylä)
Why are inverse problems ill-posed? abstract
Abstract:
Many inverse and imaging problems, such as image deblurring or electrical/optical tomography, are known to be highly sensitive to noise. In these problems small errors in the measurements may lead to large errors in reconstructions. Such problems are called ill-posed or unstable, as opposed to being well-posed (a notion introduced by J. Hadamard in 1902). The inherent reason for instability is easy to understand in linear inverse problems like image deblurring. For more complicated nonlinear imaging problems the instability issue is more delicate. We will discuss a general framework for understanding ill-posedness in inverse problems based on smoothing/compression properties of the forward map together with estimates for entropy and capacity numbers in relevant function spaces. The methods apply to various inverse problems involving general geometries and low regularity coefficients. We will use Electrical Impedance Tomography as a guiding example in the presentation. This talk is based on joint work with Herbert Koch (Bonn) and Angkana Rüland (Heidelberg).