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 Visiting

Events happening on October 20, 2026

Return to this week

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

Return to the top of the page