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
Gioacchino Antonelli (Università di Pisa/Université de Fribourg)
Horizontally polynomial functions on Lie groups abstract
Abstract:
In their proof of nonexistence of biLipschitz embeddings of the sub- Riemannian Heisenberg group H1 into L1, Cheeger and Kleiner classify the precisely monotone sets in H1. A set E is precisely monotone if both E and Ec are h-convex; a set E is h-convex when, whenever a couple of points in E is joined by an integral curve of a horizontal vector field, then such a curve is entirely contained in E.
In arbitrary connected Lie groups G endowed with the choice of a set S of bracket generating directions in the Lie algebra g of G - which we call horizontal directions - the study of a subclass of precisely monotone sets, namely the class of those sets that are sublevel sets of horizontally affine maps, naturally leads to the study of maps that are horizontally polynomial. A map (or more in general a distribution) f on a connected Lie group G is said to be horizontally polynomial if whenever X is in S, there exists k such that Xkf ≡ 0.With a geometric argument we will show that on an arbitrary connected Lie group, the horizontal polynomials of bounded degree form a finite dimensional vector space. Moreover, for connected nilpotent Lie groups, we show that horizontally polynomial distributions are precisely those maps that are polynomial in exponential coordinates. This is a joint work with E. Le Donne.
10:20 • Université de Fribourg, room Phys 2.52
Chiara Cammarota (King\'s College)
Abstract:
The realm of statistical mechanics has been enlarged to describe systems, such as glass forming materials, where structural disorder plays the predominant role. Interestingly the spectrum of applications of this new physics goes much beyond the scope of condensed matter and extends to the currently booming field of data science. In this talk I will focus on the challenge of signal-reconstruction from noisy collections of data, omnipresent in machine learning applications and in classical inference problems. By leveraging tools and ideas from glass physics, I will give some examples on how we can describe, predict, and enhance the performances of algorithms introduced to tackle these reconstruction problems.
11:00 • Universität Basel, Zoom Seminar
Bjorn Berntson (KTH Stockholm)
Generalizations of the half-wave maps equation abstract
Abstract:
The half-wave maps (HWM) equation is a recently-introduced integrable PDE with two distinct relations to the (trigonometric) spin Calogero-Moser-Sutherland (CMS) many-body system. Firstly, the HWM equation arises as a certain continuum limit of the CMS system and secondly, the soliton solutions of the HWM equation are governed by a complexified version of the CMS system. We present generalizations of the HWM equation that are similarly related to the hyperbolic and elliptic spin CMS systems. This talk is based on joint work with Rob Klabbers and Edwin Langmann.
14:15 • Universität Basel, Zoom Seminar
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. Sven Puchinger (Technische Universität München)
eSeminar: Bounds on List Decoding of Linearized Reed-Solomon Codes 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 **)
Linearized Reed-Solomon (LRS) codes are sum-rank-metric codes that fulfill the Singleton bound with equality. In the two extreme cases of the sum-rank metric, they coincide with Reed-Solomon codes (Hamming metric) and Gabidulin codes (rank metric). List decoding in these extreme cases is well-studied, and the two code classes behave very differently in terms of list size, but nothing is known for the general case. In this talk, we derive a lower bound on the list size for LRS codes, which is, for a large class of LRS codes, exponential directly above the Johnson radius. Furthermore, we show that some families of linearized Reed-Solomon codes with constant numbers of blocks cannot be list decoded beyond the unique decoding radius. The results are joint work with Johan Rosenkilde.
15:00 • Onlline Seminar