https://youtu.be/zJOWdZZcitk Speaker: Thomas Fischbacher, Google Title: New results in Supergravity via ML Technology Abstract: The infrastructure built to power the Machine Learning revolution has many other uses beyond Deep Learning. Starting from a general architecture-level overview over the lower levels of Google’s TensorFlow machine learning library, we review how this has recently helped us to […]
Title: A tour of categorical symmetry Abstract: I will discuss some perspectives on symmetry coming from the study of topological defects in quantum field theory. I will argue that we should take topological defects themselves to define the symmetries of QFT. This gives us a view of the “category of QFTs”. I will describe some […]
Abstract: A gauged linear sigma model (GLSM) consists roughly of a complex vector space V, a group G acting on V, a character \theta of G, and a G-invariant function w on V. This data defines a GIT quotient Y = and a function on that quotient. GLSMs arise naturally in a number of contexts, for […]
Title: SiRNA Targeting TCRb: A Proposed Therapy for the Treatment of Autoimmunity Abstract: As of 2018, the United States National Institutes of Health estimate that over half a billion people worldwide are affected by autoimmune disorders. Though these conditions are prevalent, treatment options remain relatively poor, relying primarily on various forms of immunosuppression which carry potentially severe […]
Speaker: Nima Arkani-Hamed (IAS Princeton) Title: UV/IR and Effective Field Theory
Speaker: Xiaoning Wu, Chinese Academy of Sciences Title: Causality Comparison and Postive Mass Abstract: Penrose et al. investigated the physical incoherence of the space-time with negative mass via the bending of light. Precise estimates of the time-delay of null geodesics were needed and played a pivotal role in their proof. In this paper, we construct […]
Member Seminar Speaker: Michael Douglas Title: Knowledge Graph Embeddings and Inference Abstract: A knowledge graph (KG) is a data structure which represents entities and relations as the vertices and edges of a directed graph. Two examples are Wikidata for general knowledge and SemMedDB for biomedical data. A popular KG representation method is graph embedding, which facilitates […]
Title: On counting algebraically defined graphs Abstract: For many classes of graphs that arise naturally in discrete geometry (for example intersection graphs of segments or disks in the plane), the edges of these graphs can be defined algebraically using the signs of a finite list of fixed polynomials. We investigate the number of n-vertex graphs in such […]
Abstract: For a given two-term complex of vector bundles on a derived scheme (or stack), there are three natural ways to define its “derived projectivizations”: (i) as the derived base-change of the classical projectivization of Grothendieck; (ii) as the derived moduli parametrizing one-dimensional locally free quotients; (iii) as the GIT quotient of the total space by […]
Abstract: In geometry and physics it has proved useful to relate G2 and Calabi-Yau geometry via circle bundles. Contact Calabi-Yau 7-manifolds are, in the simplest cases, such circle bundles over Calabi-Yau 3-orbifolds. These 7-manifolds provide testing grounds for the study of geometric flows which seek to find torsion-free G2-structures (and thus Ricci flat metrics with exceptional holonomy). They […]
Speaker: Alexei Oblomkov (University of Massachusetts) Title: Knot homology and sheaves on the Hilbert scheme of points on the plane Abstract: The knot homology (defined by Khovavov, Rozansky) provide us with a refinement of the knot polynomial knot invariant defined by Jones. However, the knot homology are much harder to compute compared to the polynomial […]
https://youtu.be/4wHwqYrCqVQ Speaker: Marijn Heule, Carnegie Mellon University Title: Computer-Aided Mathematics and Satisfiability Abstract: Progress in satisfiability (SAT) solving has made it possible to determine the correctness of complex systems and answer long-standing open questions in mathematics. The SAT solving approach is completely automatic and can produce clever though potentially gigantic proofs. We can have confidence […]