• structural aspects of von Neumann algebras arising as graph products (Rolando de Santiago, Purdue University)

    Roberts North 105, CMC 320 E. 9th St., Claremont, CA, United States

    Graph products of groups were introduced in E. Green’s thesis in the 90’s as generalizations of Right-Angled Artin Groups. These have become objects of intense study due to their key roles in topology and group theory.  Recently, Caspers and Fima introduced graph products of von Neumann algebras. Since their inception, several structural aspects such as […]

  • On zeros of multilinear polynomials (Max Forst, CGU)

    Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United States

    Consider rational polynomials in multiple variables that are linear with respect to some of the variables. In this talk we discuss the problem of finding a zero of such polynomials […]

  • Applied Math Seminar: Michael Perlmutter (UCLA)

    Claremont, CA, United States

    Title:Geometric Scattering on Measure Spaces Abstract: Geometric Deep Learning is an emerging field of research that aims to extend the success of convolutional neural networks (CNNs) to data with non-Euclidean geometric structure. Despitebeing in its relative infancy, this field has already found great success in many applications such as recommender systems, computer graphics, and traffic […]

  • GEMS March 4th Session

    Harvey Mudd College at the Shanahan Teaching and Learning Center 301 Platt Blvd., Claremont, CA, United States
  • Sometimes Pi Equals 4 (Prof. Cornelia van Cott, University of San Francisco)

    Argue Auditorium, Pomona College 610 N. College Ave., Claremont, CA, United States

    Title: Sometimes Pi Equals 4 Speaker: Cornelia van Cott, Department of Mathematics, University of San Francisco Abstract: Most of your mathematical life, you've known that pi is a number somewhere between […]

  • Robust properties of graphs (Asaf Ferber, UC Irvine)

    Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United States

    In this talk we will consider some notions of `robustness' of graph/hypergraph properties. We will survey some existing results and will try to emphasize the following new result (joint with Adva Mond and Kaarel Haenni): The binomial random digraph $D_{n,p}$ typically contains the minimum between the minimum out- and in-degrees many edge-disjoint Hamilton cycles, given […]