Since deciding whether a given graph is 3-colourable is NP-complete, and checking validity of a colouring is an easy problem, also the problem of finding a colouring of a 3-colourable graph with 3 colours is a well-known NP-complete. One might be interested in a relaxed version of this problem, e.g., finding a colouring of a 3-colourable graph that uses 6 colours. This falls into a more general scope of so-called promise constraint satisfaction problem (PCSP). We will describe the basics of a theory characterising when one promise constraint satisfaction problem can be reduced to another using a gadget reduction.
A theory of gadget reductions for promise constraint satisfaction II
Many of our calculus 1-3 students know how to get their computers do their homework, so why can't we do the same for ours? We will explore the notion of type theories and how they can be used as a formal foundation of mathematics, in contrast to typical set-theoretic foundations. We will then explore how proof assistants like Lean actually apply type theory to formalize mathematics. If time permits, we will briefly discuss some of the main "points" of Homotopy Type Theory and current research into its implementation.
A Tour of Type Theory
Feb. 25, 2021 5pm (Zoom (vir…
Rep Theory
Robert McRae (Tshinghua University)
X
I will discuss work in progress related to proving semisimplicity of the module category for a suitable positive-energy, self-contragredient, C_2-cofinite vertex operator algebra V. The goal is to show that the category of V-modules is semisimple if the Zhu algebra of V is a semisimple algebra. The idea for proving this is to show that the braided tensor category of V-modules is rigid with a non-degenerate braiding, using tensor-categorical methods combined with the modular invariance methods used by Huang to prove the Verlinde conjecture for rational vertex operator algebras.
What's undergraduate math research anyways? Who is it for? It might not be what you think it's like and it might be for you, even if you haven't realized it yet! So come to the Math Club on Thursday Feb 25 at 5:15 pm to learn more about undergraduate math research and the opportunities for math research experiences available to CU undergrads. And if you're wondering, does math research happen online? The answer is absolutely!