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
Alessandro Olgiati (Universität Zürich)
Abstract:
We study the ground state properties of a system of bosonic particles trapped by a double-well potential, in the limit of large inter-well separation and of high potential barrier. The N bosons also interact via a mean-field two-body potential, in the limit of large N.The leading-order physics is governed by a Bose-Hubbard Hamiltonian coupling two low-energy modes, each supported in the bottom of one well. Fluctuations beyond these two modes are ruled by two independent Bogoliubov Hamiltonians, one for each well.Our main result is that the variance of the number of particles in the low-energy modes is suppressed. This is a violation of the Central Limit Theorem which holds in the occurrence of Bose-Einstein condensation, and therefore it signals that particles develop correlations in the ground state. We achieve our result by proving a precise energy expansion in term of Bose-Hubbard and Bogoliubov energies.Joint work with Nicolas Rougerie (ENS Lyon) and Dominique Spehner (Universidad de Concepción).
14:00 • 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. Umberto Martinez-Penas (University of Neuchâtel)
eSeminar: Constructions of Codes in the Sum-Rank Metric 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 **)
The sum-rank metric simultaneously extends the Hamming metric and the rank metric. Thus it provides a general theory that includes both classical and rank-metric codes. In this talk, we will present several constructions of Maximum Sum-Rank Distance (MSRD) codes. Each of these codes outperforms all possible MRD codes in the applications, as they require polynomial field sizes (in contrast with exponential field sizes for MRD codes). Our constructions include our previous construction of linearized Reed-Solomon codes, which simultaneously generalize Reed-Solomon codes and Gabidulin codes. At the end, we will present Sum-Rank BCH codes, a family of subfield subcodes of linearized Reed-Solomon codes with small field sizes and good parameters, and which extend classical BCH codes.
15:00 • Onlline Seminar
Prof. Dr. Martijn Kool (University of Utrecht)
Proof of Magnificent Four abstract
Abstract:
Motivated by super-Yang–Mills theory on a Calabi–Yau 4-fold, Nekrasov and Piazzalunga assigned weights to r-tuples of solid partitions (4-dimensional piles of boxes) and conjectured a formula for their weighted generating function.We define K-theoretic virtual invariants of Quot schemes of 0-dimensional quotients of O^r on affine 4-space by realizing them as zero loci of isotropic sections of orthogonal bundles. Using the Oh–Thomas localization formula, we recover Nekrasov–Piazzalunga’s weights. Applying ideas from Okounkov in the 3-dimensional case, we prove Nekrasov-Piazzalunga’s formula. Joint work with J. Rennemo.
15:00 • Zoom