Statement on Black Lives Matter
Title: Weighted pullbacks in V-graded categories
Abstract: Introduced by Richard Wood in 1976, categories graded by a monoidal category V generalize both V-actegories and V-enriched categories. In this talk, we review some basics of V-graded categories, and then we introduce a notion of weighted pullback in V-graded categories. Weighted pullbacks are certain weighted limits that generalize the usual (conical) pullbacks, yet they also specialize to certain notions of universal quantification and certain dependent products. Indeed, weighted pullbacks generalize simple products in the codomain fibration of a cartesian closed category with finite limits and, in particular, simple universal quantification in the subobject fibration of such a category. Generalizing the latter example, we introduce notions of simple product and simple universal quantification in V-actegories as special cases of the notion of weighted pullback. In particular, weighted pullbacks thus give rise to a notion of simple universal quantification in monoidal categories.
Title: The Intersection between Number Theory, Abstract Algebra, and Cryptography
Abstract: In this talk we will cover the mathematics behind a security system that is thought to be secure against quantum computer hacking; the Supersingular Ell Isogeny Cryptosystem. Specifically the Supersingular Ell Isogeny Graph. This abstract object is made of isomorphic elliptic curves and equivalent homomorphisms between them. The Supersingular Ell Isogeny graph is an extremely complicated graph that is used for cryptosystems (for the future), but we will use a simpler approach to find patterns within this convoluted graph.
Title: Systems of homotopy colimits
Abstract: Limits and colimit constructions are ubiquitous in category theory, and are one of the main tools used to understand how objects in a category relate to one another. These are very concrete and easily stated in terms of universal properties: given a diagram in a category, the colimit is the initial cocone making the resulting diagram commute. Homotopy colimits, on the other hand, have always been more difficult to define. These so not satisfy a universal property in any category, and tend to be described in terms of a construction and properties. In recent work with Brooks-Hess-Johnson-Rasmusen-Schreiner (BBHJRS for short) we attempted to enumerate the properties required for something to be a system of homotopy colimits. Following a referee’s comments, we transformed the list into a more familiar categorical construction. In this talk, I will offer an alternative definition of homotopy colimits using actegories.
Title: What can you buy with a bicategory?
Abstract: In this talk we’ll continue to get to know bicategories by learning about what you can do inside a bicategory. We’ll learn about pasting diagrams as well as adjoints and equivalences inside bicategories before presenting some examples of what these equivalences can look like in certain examples (and in doing so, we will recapture the notion of Morita equivalence of rings). Also Geoff had fun giving this talk.
Title: Saying Hello to Bicategories
Abstract: Bicategories are an important aspect of modern category theory and provide the first instance of “category theory up to coherent isomorphism” we see when hiking up Mount Higher Category Theory. In this talk I will introduce the notion of bicategories, what we can do with them, and explain some of their basic properties. There will also be many, many examples presented in order to both show people who are first becoming introduced to bicategories what flavours in which they can arise and also to keep the talk (somewhat) grounded.
This will be a 2 part talk on Friday Sept 13th and Friday Sept 20th.
Title: The scheaf of distributions
Abstract: Originally distributions were introduced in PDE-theory to generalize the notion of functions. However, this analytical concept also has some purely algebraic properties, which are worth considered.
In particular, they are an important example of sheaves in differential geometry. In this talk we are going to discuss two views on distributions and their connections. On one hand, distributions can be considered as generalized densities (a broader version of the determinant) and on the other hand as generalized functions. The latter, as we are going to show, form a sheaf, which gives us an insight on the sheaf-structure of distributions.
Title: Strict Monoidal Categories as Internal Monoids.
Abstract: Internalization is a paradigm for the generalization of classical mathematical definitions, e.g. monoid generalizes to internal monoid in a monoidal category, or group generalizes to internal group in a category with finite products. In this talk, we will demonstrate that strict monoidal categories may profitably be studied as internal monoids in the 1-category of 1-categories. We present detailed calculations pertaining to limits and colimits of internal monoid objects, while relying on little more than the material of an introductory course in category theory.
Title: Vogan’s conjecture for p-adic GL_n
Abstract: Local Arthur packets are sets of representations of p-adic groups that help us realize important classes of automorphic forms. They have geometric analogues, called ABV-packets. This was first proposed for p-adic groups by David Vogan following his joint work with Adams and Barbasch for real groups. This theory was then adapted by Cunningham et al. for the non-archimedean case. They defined ABV-packets and formulated the conjecture that ABV-packets generalize local Arthur packets. They called it “Vogan’s conjecture” to honour the work that led to it, in addition to providing a wealth of examples as evidence. In this talk, I will introduce ABV-packets and present a proof of Vogan’s conjecture for p-adic GL_n .
Title: Type Classes in CaMPL
Abstract: Overloading, which allows functions to exhibit different behaviors based on the types involved, is one of the most useful facilities of a typed programming language. In the Haskell programming language, this facility is provided by type classes. Type classes offer a systematic solution for overloading, providing uniform operations for arithmetic, equality, and displaying values, and so on. In addition, higher-order type classes are used to implement important more advanced structures such as functors and monads.
Categorical Message Passing Language (CaMPL) is a concurrent programming language based on a categorical semantic given by a linear actegory. CaMPL has with type inference for both sequential and concurrent programs. The sequential side of CaMPL is a functional-style programming language, while the concurrent side supports message passing between processes along channels with concurrent types called protocols.
In this presentation, first the importance of type classes will be discussed, then CaMPL will be introduced, and its different features will be explained. Finally, the process of integrating type classes into both sequential and concurrent tiers of CaMPL will be investigated.
Title: Awesome Reversible Knitting
Abstract: Reversible Knitting is a specialized branch of knitting focussed on creating fabric that looks beautiful on both sides, lies flat and doesn’t curl, and has a wonderful hand feel and texture. It is technically intriguing, creatively satisfying, and practically flexible!
This talk will provide applications of math in reversible knitting, touching on a variety of concepts including topology, notation, sets, balance and duality, tiling and geometry, rotational symmetry and translation, flat vs circular vs möbius knitting, gauging and ratios, and even physics!
Starting with the two fundamental knitting stitches, Knits and Purls, we will explore reversible knitting definitions, the fascinating Möbius knitting and end with the “reversiblest” stitch pattern known.
Although no physical knitting experience is required or provided, I will supplement the talk with a selection of knitted fabrics as examples of each concept.
