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
Fabrizio Leisen (Univeristy of Nottingham)
Abstract:
Several studies on heritability in twins aim at understanding the different contribution of environmental and genetic factors to specific traits. Considering the National Merit Twin Study, our purpose is to correctly analyse the influence of the socioeconomic status on the relationship between twins’ cognitive abilities. Our methodology is based on conditional copulas, which allow us to model the effect of a covariate driving the strength of dependence between the main variables. We propose a flexible Bayesian nonparametric approach for the estimation of conditional copulas, which can model any conditional copula density. Our methodology extends previous work by introducing dependence from a covariate in an infinite mixture model. Our results suggest that environmental factors are more influential in families with lower socio-economic position.
11:00 • Universität Basel, Zoom Seminar
Jonas Lampart (CNRS, LICB)
Abstract:
We will discuss some properties of the set of all trajectories that can be obtained from a fixed initial state by varying the potential in the Schrödinger equation.This is related to the control problem, i.e. driving the system to a target state, which turns out to be impossible for "typical" target states using bounded potentials.
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
Prof. Dr. Alberto Ravagnani (Eindhoven University of Technology)
eSeminar: The Sparseness of MRD 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 **)
An open question in coding theory asks whether or not MRD codes with the rank metric are dense as the field size tends to infinity. In this talk, I will briefly survey this problem and its connections with the theory of spectrum-free matrices and semifields. I will then describe a new combinatorial method to obtain upper and lower bounds for the number of codes of prescribed parameters, based on the interpretation of optimal codes as the common complements of a family of linear spaces. In particular, I will answer the above question in the negative, showing that MRD codes are almost always (very) sparse as the field size grows. The approach offers an explanation for the strong divergence in the behaviour of MDS and MRD codes with respect to density properties. I will also present partial results on the sparseness of MRD codes as their column length tends to infinity. The new results in this talk are joint work with A. Gruica.
15:00 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 28
Dr. Woonam Lim (ETH Zürich)
Virtual invariants of Quot schemes of surfaces II abstract
Abstract:
Let S be a smooth projective surface. Grothendieck’s Quot scheme on S admits a 2-term perfect obstruction theory when it parametrizes torsion quotients. This allows us to define various virtual invariants of Quot schemes, including homological (K-theoretic) descendent invariants and virtual Segre/Verlinde numbers. The study of these invariants is partially motivated by the parallel theory of moduli of sheaves. A special feature of the Quot scheme theory is the conjectural rationality of the homological (K-theoretic) descendent series. We explain how this can be proven for all surfaces with p_g>0 using the multiplicative structural formula involving Seiberg-Witten invariants. The same method applies to the study of the virtual Segre/Verlinde series. We also explain the virtual Segre/Verlinde correspondence and a special symmetry for punctual Quot schemes which is reminiscent of the numerical strange duality.
15:00 • Zoom
Prof. Dr. Hans Feichtinger (University of Vienna)
Gabor Analysis: Background, Concepts and Computational Issues abstract
Abstract:
Gabor Analysis goes back to the fundamental paper of D. Gabor from 1946, who expressed (resp. conjectured) that every function can be expanded into a series of time-frequency shifted version of the standard Gaussian, meaning by building blocks of the form
g_{k,n}(x) = exp(2 \\pi i b n} g_0(x - ak),
with $g_0(t) = exp(-\\pi t^2)$. By choosing $a=1=b$ he was hoping to expand "every signal in a unique way", thus having a natural interpretation of the energy at position $(k,n)$ in phase-space through the (expected) unique coefficients for such an expansion.
Only since 35 years mathematicians have taken care of this problem, which provides a number of interesting challenges, going far beyond the original problem. From the speaker\'s point of view there is not only the computational problem arising (since Gabor Analysis can also be realized in the context of finite, Abelian groups), but also a variety of functional analytic concepts, including the idea of Banach frames and Banach Gelfand Triples.
The methods developed in the last 25 years are also relevant for the teaching of classical Fourier Analysis (such a course has been held at ETH last semester by the speaker), but also provides a good platform for the formulation of "Conceptual Harmonic Analysis", where the main question concerns the relationship between the continuous formulation of a problem and the corresponding discrete version and its computational realization.