Search

A. I. Algebraic Geometry Algebra/Logic DeLong Diversity Functional Analysis Grad Algebra/Logic Homotopy Init Conditions Kempner Lie Theory Math Club Math Phys Noncomm Geometry Number Theory PDE/Analysis Probability Rep Theory Grad Student Seminar Thesis Defenses Topology Ulam Math Edu

Events for the weeks of October 18th – 30th

Print these events

Tue, Oct. 20 1:25pm (online)	Algebra/Logic Michael Kompatscher (Charles University Prague) View Online:https://cuboulder.zoom.us/j/96896272260 X An (abstract) minion M is a functor from the category of finite sets to the category of sets. So, for every finite set X, there is a set M(X) (the 'X-ary' part of M), and for every function f: X -> Y there is a function M(f) : M(X) -> M(Y) such that M preserves the identity and composition. Every variety V naturally gives rise to a minion F_V, where F_V(X) is the free algebra generated by X and F_V(f) : F_V(X) -> F_V(Y) is the unique homomorphism extending f: X -> Y. In this talk I would like to discuss a nice (multilinear) description of this minion for the variety of n-step nilpotent groups. This description is based on concepts from combinatorics on words (subword counting) and a result by Fox, Lyndon and Chen from 1958, and motivated by the study of uniform algorithms for constraint satisfaction problems (CSPs). The minion of free n-step nilpotent groups
Tue, Oct. 20 2:30pm (MATH 3…	Lie Theory Spencer Daugherty (CU Boulder) X The Tamari lattice is a poset that captures structure related to the associative law. It has importance in Catalan combinatorics, lattice theory, polyhedral geometry, and the study of the diagonal coinvariants. We unify the Tamari lattice and two of its generalizations as objects contained within a larger infinite lattice we call the stable Tamari lattice. We discuss various lattice properties as well as interesting results on height generating functions of intervals. We also study the structure and enumeration of principal lower order ideals. The stable Tamari lattice
Tue, Oct. 20 3:30pm (MATH 3…	Topology Coby Glass X Topological Data Analysis (TDA) is very promising in the field of cybersecurity anomaly detection, but is traditionally too computationally bottlenecked for use in real-time environments. This talk explores the pipeline from industrial application to hardware-accelerated mathematics, beginning with the challenges of embedding non-geometric cybersecurity data into valid metric spaces for Vietoris-Rips filtrations. After demonstrating a functional TDA-to-machine-learning pipeline, we will briefly examine the algebraic optimizations that make this possible on modern computing architectures. Finally, the presentation will discuss the potential for hardware-accelerated TDA, specifically designing systolic arrays to compute matrix rank over GF(2) via chunked Gaussian elimination. Topological Anomaly Detection on Real-Time Data
Wed, Oct. 21 3pm (KCEN MPR …	DeLong Bhargav Bhatt (Institute for Advanced Study & Princeton University) View Online:https://cuboulder.zoom.us/j/97834671785 X What if two numbers were considered close not when their difference is small, but when it is divisible by a large power of a fixed prime $p$ ? Following this seemingly strange idea leads to the $p$ -adic numbers, a concept introduced in the late nineteenth century that has transformed number theory and found applications throughout mathematics. This lecture will explain where the $p$ -adic numbers came from, how they differ from the familiar real numbers, and why they are useful. The p-adic world Sponsored by the Meyer Fund
Thu, Oct. 22 11am (KCEN MPR…	DeLong Bhargav Bhatt (Institute for Advanced Study & Princeton University) View Online:https://cuboulder.zoom.us/j/97834671785 X Over the past fifteen years, the discovery of perfectoid geometry and related ideas has provided new lenses through which to study $p$ -adic spaces at an extraordinarily fine scale. The resulting methods have resolved longstanding questions across algebraic geometry, number theory, homotopy theory, and beyond. In this lecture, I will recount some of this story, emphasizing the applications that motivated the conceptual developments. Recent developments in p-adic geometry Sponsored by the Meyer Fund
Thu, Oct. 22 2:30pm (MATH 3…	Functional Analysis James Woodcock (CU Boulder) X A finite directed graph gives rise to several objects at once: dynamical systems, inverse semigroups, étale groupoids, and C-algebras. This talk is an introduction to these constructions and how they classify graphs. We will discuss classical invariants of graphs and how these are realized through topological invariants of groupoids and C-algebras. We will also discuss how these invariants and other objects classify graphs. No previous familiarity with symbolic dynamics is assumed. The talk also sets up the second part, where these equivalences are revisited from a combinatorial point of view. C*-algebras and finite graphs Part I
Fri, Oct. 23 1:25pm (Zoom)	A. I. Max Weinreich (CUNY) X In this talk, I present the case for total opposition to the use of artificial intelligence in mathematics. I offer proposals for how individuals, departments, journals, and institutions can act in concert to make sure that mathematics survives the coming crisis. The Crisis of AI-Generated Mathematics
Wed, Oct. 28 3:30pm (Math350)	Math Phys Austin Walsh (University of Colorado Boulder) C*-algebraic quantum mechanics
Wed, Oct. 28 4:40pm (MATH 3…	Grad Student Seminar Sylvia Maher (CU Boulder) X TBD A Brief Overview of the Weil Conjectures
Thu, Oct. 29 11:15am (MATH …	Algebraic Geometry Shend Zhjeqi (Michigan) X TBD TBD Sponsored by the Meyer Fund
Thu, Oct. 29 2:30pm (MATH 3…	Functional Analysis James Woodcock (CU Boulder) X We introduce a notion of a graph module which we will use as a unifying framework for the study of the graph algebras and graph groupoids. We will define graph modules and spell out some elementary properties. We will then explain how the Bowen Franks group and the dimension triple can be realized concretely by studying the category of modules over a graph. After this we will generalize this to bimodules and construct a bicategory of graphs and show how this is the category of flow equivalence of graphs. We will give examples and discuss their connection with wrong way maps between graph algebras. C*-algebras and finite graphs Part II
Fri, Oct. 30 1:25pm (Math 3…	A. I. Matt Grimes (Amazon) TBA

Return to the top of the page