עמוד זה מציג את כל האירועים המתרחשים במחלקה השבוע. ניתן לבחור שבוע אחר, או תאריכים שונים, בשדות בתחתית העמוד.

AGNT

Some Schur-Weyl Dualities

נוב 7, 15:10—16:25, 2018, -101

מרצה

Kieran Ryan (Queen Mary University of London)

תקציר

Schur-Weyl Duality is a remarkable theorem giving an intimate link between the representation theories of the Symmetric group S_n, and the General Linear group GL(k). Such a link also holds between other objects, in particular the Brauer Algebra and the Orthogonal group, and the Walled Brauer algebra and GL(k). I will give an introduction to these relationships.

BGU Probability and Ergodic Theory (PET) seminar

תב“ה

נוב 8, 11:00—12:00, 2018, -101

מרצה

הסמינר מבוטל בשל סדנא על stack

אשנב\צוהר למתמטיקה

What is the sum of angles of an n-gon? … Wait, I meant an n-gon in the 3-dimensional space!

נוב 12, 18:00—19:00, 2018, אולם 101-

מרצה

אורי בדר (מכון ויצמן)

תקציר

הרצאת אורח במסגרת סמינר ”Action Now“ שמתקיים ביום זה אצלנו

אחרי ההרצאה יתקיים קונצרט ג‘אז של ההרכב ”Perverse Sheaves“ של צחיק

קולוקוויום

Recent developments in 3-manifold topology

נוב 13, 14:30—15:30, 2018, Math -101

מרצה

Stefan Friedl (Regensburg University)

תקציר

We will explain the Geometrization Theorem proved by Perelman in 2003 and we will talk about the Virtual Fibering Theorem proved several years ago by Ian Agol and Dani Wise. I will not assume any previous knowledge of 3-manifold topology.

Combinatorics Seminar

Finitely Forcible Graphons

נוב 13, 16:10—17:10, 2018, 201

מרצה

Roman Glebov (BGU)

תקציר

Abstract: In extremal graph theory, we often consider large graphs that are in the limit uniquely determined by finitely many densities of their subgraphs. The corresponding limits (so-called graphons) are called finitely forcible. Motivated by classical results in extremal combinatorics as well as by recent developments in the study of finitely forcible graphons, Lovasz and Szegedy made some conjectures about the structure of such graphons. In particular, they conjectured that the topological space of typical points of every finitely forcible graphon is compact and finitely dimensional. In joint results with D. Kral, T. Klimosova, and J. Volec, we could disprove both conjectures.


תאריכים אחרים