Title: How do zebrafish get their stripes — or spots? Abstract: Many natural and social systems involve individual agents coming together to create group dynamics, whether the agents are drivers in a traffic jam, voters in an election, or locusts in a swarm. Self-organization also occurs at much smaller scales in biology, though, and here […]
In this talk, we present reduced order models (ROMs) for turbulent flows, which are constructed by using ideas from large eddy simulation (LES) and variational multiscale (VMS) methods. First, we give a general introduction to reduced order modeling and emphasize the connection to classical Galerkin methods (e.g., the finite element method) and the central role […]
Title: Groups, Graphs and Trees Abstract: What do we mean by the geometry of a group? Groups seem like very abstract objects when we first study them, and it's natural to ask whether we can visualize them in some way. Given a group with a finite set of generators and relators, I will describe a […]
Abstract: Classification is a fundamental task in data science and machine learning, and in the past ten years there have been significant improvements on classification tasks (e.g. via deep learning). However, recently there have been a number of works demonstrating that these improved algorithms can be "fooled" using specially constructed adversarial examples. In turn, there […]
Title: Trace Ideals and Endomorphism Rings Abstract: In many branches of mathematics, the full set of "functions" between two objects exhibits remarkable structure; it often forms a group and in some special cases it forms a ring. In this talk, we will discuss this phenomenon in Commutative Algebra. In particular, we will talk about the […]
Abstract: This talk discusses multiple methods for clustering high-dimensional data, and explores the delicate balance between utilizing data density and data geometry. I will first present path-based spectral clustering, a novel approach which combines a density-based metric with graph-based clustering. This density-based path metric allows for fast algorithms and strong theoretical guarantees when clusters concentrate […]
Title: Puzzling Permutations Abstract: Permutations are one of the most fundamental notions in mathematics. In this talk, we will discuss a visual representation of permutations and introduce some games one can play to help "see" different properties. These puzzling games can be used to provide insight into deeper mathematical content as well. Time permitting, we […]
Given a homogeneous multilinear polynomial F(x) in n variables with integer coefficients, we obtain some sufficient conditions for it to represent all the integers. Further, we derive effective results, establishing bounds on the size of a solution x to the equation F(x) = b, where b is any integer. For a special class of polynomials […]
In this talk we will survey recent developments in the use of ternary algebraic structures known as Niebrzydowski Tribrackets in defining invariants of knots, with some perhaps surprising applications.
In this talk we introduce a new modification of the Jacobi-Perron algorithm in the three dimensional case. This algorithm is periodic for the case of totally-real conjugate cubic vectors. To the best of our knowledge this is the first Jacobi-Perron type algorithm for which the cubic periodicity is proven. This provides an answer in the […]
Title: Topic Models, Methods, and Medicine Speaker: Prof. Jamie Haddock (Harvey Mudd College) Abstract: There is currently an unprecedented demand for efficient, quantitative, and interpretable methods to study large-scale (often multi-modal) data. One key area of interest is that of topic modeling, which seeks to automatically learn latent trends or topics of complex data sets, […]
Title: Eigenvector Methods for Community Detection in Hypergraphs Abstract: Hypergraphs are generalizations of graphs in which edges are allowed to contain arbitrary numbers of nodes. Hypergraphs are well-suited for modeling […]
