Talk_id  Date  Speaker  Title 
29089

Thursday 8/26 2:30 PM

Deanna Needell, UCLA

On the topic of topic modeling: enhancing machine learning approaches with topic features
 Deanna Needell, UCLA
 On the topic of topic modeling: enhancing machine learning approaches with topic features
 08/26/2021
 2:30 PM  2:30 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
In this talk we touch on several problems in machine learning that can benefit from the use of topic modeling. We present topic modeling based approaches for online prediction problems, computer vision, text generation, and others. While these problems have classical machine learning approaches that work well, we show that by incorporating contextual information via topic features, we obtain enhanced and more realistic results. These classical methods include nonnegative matrix and tensor factorization, generative adversarial networks, and even traditional epidemiological SIR models for prediction. In this talk we provide a brief overview of these problems and show how topic features can be used in these settings. We include supporting theoretical and experimental evidence that showcases the broad use of our approaches.

29090

Thursday 9/2 4:30 AM

Jonathan Scarlett, National University of Singapore

Beyond Sparsity: Compressive Sensing with (Deep) Generative Modeling Assumptions
 Jonathan Scarlett, National University of Singapore
 Beyond Sparsity: Compressive Sensing with (Deep) Generative Modeling Assumptions
 09/02/2021
 4:30 AM  5:30 AM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
The problem of estimating an unknown vector from linear measurements has a long history in statistics, machine learning, and signal processing. Classical studies focus on the "n >> p" regime (#measurements >> #parameters), and more recent studies handle the "n << p" regime by exploiting lowdimensional structure such as sparsity or lowrankness. Such variants are commonly known as compressive sensing.
In this talk, I will overview recent methods that move beyond these simple notions of structure, and instead assume that the underlying vector is wellmodeled by a generative model (e.g., produced by deep learning methods such as GANs). I will highlight algorithmic works that demonstrated up to 510x savings in the number of measurements over sparsitybased methods, and then move on to our theoretical work characterizing the orderoptimal sample complexity in terms of quantities such as (i) the Lipschitz constant of the model, or (ii) the depth/width in a neural network model. I will also briefly highlight some recent results on nonlinear observation models.

29102

Friday 9/3 3:00 PM

Joshua Ruiter, MSU

Organizing meeting for student algebra seminar
 Joshua Ruiter, MSU
 Organizing meeting for student algebra seminar
 09/03/2021
 3:00 PM  4:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Joshua Ruiter (ruiterj2@msu.edu)
We'll discuss plans for the student algebra seminar this semester, e.g. choosing our first few speakers.

29103

Tuesday 9/7 4:00 PM

Sucharit Sarkar, UCLA

Link Floer spectrum via grid diagrams
 Sucharit Sarkar, UCLA
 Link Floer spectrum via grid diagrams
 09/07/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Honghao Gao (gaohongh@msu.edu)
Link Floer homology of links in S^3 can be computed as the homology of a grid chain complex defined using grid diagrams. I will describe a construction of a CW spectrum whose cells correspond to the generators of the grid chain complex, and whose cellular chain complex is the grid chain complex (and therefore, the homology is link Floer homology). This is joint with Ciprian Manolescu.

29100

Wednesday 9/8 3:00 PM

Emily Gunawan, Oklahoma University

Boxball systems and RobinsonSchenstedKnuth tableaux
 Emily Gunawan, Oklahoma University
 Boxball systems and RobinsonSchenstedKnuth tableaux
 09/08/2021
 3:00 PM  3:50 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Bruce E Sagan (bsagan@msu.edu)
The RobinsonSchensted (RS) correspondence is a famous bijection between permutations and pairs (P,Q) of standard tableaux of the same shape, called the RS partition. The RS partition and its conjugate record certain permutation statistics called Greene’s theorem statistics.
A boxball system is a discrete dynamical system which can be thought of as a collection of time states. A permutation on n objects gives a boxball system state by assigning its oneline notation to n consecutive boxes. After a finite number of steps, a boxball system will reach a steady state. From any steady state, we can construct a tableau (not necessarily standard) called the soliton decomposition. The shape of the soliton decomposition is called the BBS partition. An exciting discovery (made in 2019 by Lewis, Lyu, Pylyavskyy, and Sen) is that the BBS partition and its conjugate record a localized version of Greene’s theorem statistics.
We will discuss a few new results:
(1) The Q tableau of a permutation completely determines the dynamics of the corresponding boxball system.
(2) The permutations whose BBS partitions are Lshaped have steadystate time at most 1. This large class of permutations include column reading words and noncrossing involutions.
(3) If the soliton decomposition of a permutation is a standard tableau or if its BBS partition coincides with its RS partition, then its soliton decomposition and its P tableau are equal.
(4) Finally, we study the permutations whose P tableaux and soliton decompositions coincide and refer to them as “good". These “good” permutations are closed under consecutive pattern containment. Furthermore, we conjecture that the “good” Q tableaux are counted by the Motzkin numbers.
This talk is based on REU projects with Ben Drucker, Eli Garcia, Aubrey Rumbolt, Rose Silver (UConn Math REU 2020) and Marisa Cofie, Olivia Fugikawa, Madelyn Stewart, David Zeng (SUMRY 2021).

29098

Wednesday 9/8 4:00 PM

Alexander Volberg, MSU

Drastic differences between the potential theories on trees and on multitrees
 Alexander Volberg, MSU
 Drastic differences between the potential theories on trees and on multitrees
 09/08/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Dapeng Zhan (zhan@msu.edu)
No abstract available.

29094

Thursday 9/9 2:30 PM

Anna Ma, University of California, Irvine

The Kaczmarz Algorithm: Greed, Randomness, and Tensors
 Anna Ma, University of California, Irvine
 The Kaczmarz Algorithm: Greed, Randomness, and Tensors
 09/09/2021
 2:30 PM  3:30 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
The Kaczmarz algorithm is an iterative method for solving linear systems of equations of the form Ax=y. Owing to its low memory footprint, the Kaczmarz algorithm has gained popularity for its practicality in applications to largescale data, acting only on single rows of A at a time. In this talk, we discuss selecting rows of A randomly (Randomized Kaczmarz), selecting rows in a greedy fashion (Motzkin's Method), and selecting rows in a partially greedy fashion (Sampling KaczmarzMotzkin algorithm). Despite their variable computational costs, these algorithms have been proven to have the same theoretical upper bound on the convergence rate. Here we present an improvement upon previous known convergence bounds of the Sampling KaczmarzMotzkin algorithm, capturing the benefit of partially greedy selection schemes. Time permitting, we also will discuss an extension of the Kaczmarz algorithm to the setting where data takes on the form of a tensor and make connections between the new Tensor Kaczmarz algorithm and previously established algorithms. This presentation contains joint work with Jamie Haddock and Denali Molitor.

29104

Friday 9/10 3:00 PM

Joshua Ruiter, MSU

Abstract representations of special unitary groups
 Joshua Ruiter, MSU
 Abstract representations of special unitary groups
 09/10/2021
 3:00 PM  4:00 PM

(Virtual Meeting Link)
 Joshua Ruiter (ruiterj2@msu.edu)
We'll discuss the background material for the main result of the following paper: https://arxiv.org/abs/2107.07351. We'll start by talking about quasisplit special unitary groups and the associated Steinberg groups. If we have time, we'll talk about algebraic rings. This will be the first in a sequence of two talks on this paper.

29110

Tuesday 9/14 11:10 AM

Matthew Lorentz, Michigan State University

Derivations and the Hochschild Cohomology of Uniform Roe Algebras, Part 1
 Matthew Lorentz, Michigan State University
 Derivations and the Hochschild Cohomology of Uniform Roe Algebras, Part 1
 09/14/2021
 11:10 AM  12:00 PM
 C304 Wells Hall
 Brent Nelson (banelson@msu.edu)
In this series of talks we show a necessary and sufficient condition for the vanishing of the Hochschild cohomology of a uniform Roe algebra. Specifically, the ndimensional continuous Hochschild cohomology vanishes if and only if every norm continuous nlinear map from the uniform Roe algebra to itself is equivalent to a weakly continuous nlinear map.
In our first talk we will begin defining and discussing derivations as they are an important building block of Hochschild cohomology. Motivated by the needs of mathematical physics and the study of oneparameter automorphism groups, it is interesting to study whether all derivations are inner (i.e. given by the commutator bracket) for a particular C*algebra. In the 1970s, a complete solution to this problem was obtained in the separable case via the work of several authors. For nonseparable C*algebras the picture is murkier. Our main goal in this talk is to give a new class of examples that only have inner derivations: uniform Roe algebras, which are separable only in the trivial finite dimensional case. Uniform Roe algebras were originally introduced for indextheoretic purposes but are now studied for their own sake as a bridge between C*algebra theory and coarse geometry, as well as having interesting applications to single operator theory. Lastly, we will briefly explain how the uniform Roe algebra only having inner derivations is equivalent to the first Hochschild cohomology vanishing.

29101

Tuesday 9/14 4:00 PM

Peter Johnson, UVA

A zero surgery obstruction from involutive Heegaard Floer homology
 Peter Johnson, UVA
 A zero surgery obstruction from involutive Heegaard Floer homology
 09/14/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Honghao Gao (gaohongh@msu.edu)
A fundamental result in 3manifold topology due to Lickorish and Wallace says that every closed oriented connected 3manifold can be realized as surgery on a link in the 3sphere. One may therefore ask: which 3manifolds can be obtained by surgery on a link with a single component, i.e. a knot, in the 3sphere? More specifically, one can ask: which 3manifolds are obtained by zero surgery on a knot in the 3sphere? In this talk, we give a brief outline of some known results to this question in the context of small Seifert fibered spaces. We then sketch a new method, using involutive Heegaard Floer homology, to show that certain 3manifolds cannot be obtained by zero surgery on a knot in the three sphere. In particular, we produce a new infinite family of weight 1 irreducible small Seifert fibered spaces with first homology Z which cannot be obtained by zero surgery on a knot in the 3sphere, extending a result of Hedden, Kim, Mark and Park.

29114

Wednesday 9/15 3:00 PM

Oliver Pechenik, University of Waterloo

What is the degree of a Grothendieck polynomial?
 Oliver Pechenik, University of Waterloo
 What is the degree of a Grothendieck polynomial?
 09/15/2021
 3:00 PM  3:50 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Bruce E Sagan (bsagan@msu.edu)
Jenna Rajchgot observed that the CastelnuovoMumford regularity of matrix Schubert varieties is computed by the degrees of the corresponding Grothendieck polynomials. We give a formula for these degrees. Indeed, we compute the leading terms of the top degree pieces of Grothendieck polynomials and give a complete description of when two Grothendieck polynomials have the same top degree piece (up to scalars). Our formulas rely on some new facts about major index of permutations. (Joint work with David Speyer and Anna Weigandt.)

29099

Wednesday 9/15 4:00 PM

Kleinhenz, Perry, MSU

Stabilization rates for the damped wave equation with polynomial and oscillatory damping
 Kleinhenz, Perry, MSU
 Stabilization rates for the damped wave equation with polynomial and oscillatory damping
 09/15/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Dapeng Zhan (zhan@msu.edu)
In this talk I will discuss energy decay of solutions of the Damped wave equation. After giving an overview of classical results I'll focus on the torus with damping that does not satisfy the geometric control condition. In this setup properties of the damping at the boundary of its support determine the decay rate, however a general sharp rate is not known.
I will discuss damping which is 0 on a strip and vanishes either like a polynomial x^b or an oscillating exponential e^{1/x} sin^2(1/x). Polynomial damping produces decay of the semigroup at exactly t^{(b+2)/(b+3)}, while oscillating damping produces decay at least as fast as t^{4/5+\delta} for any \delta>0. I will explain how these model cases are proved and how they direct further study of the general sharp rate.

29107

Wednesday 9/15 4:00 PM

Yoonjoo Kim, Stony Brook University

The dual Lagrangian fibration of compact hyperKahler manifolds
 Yoonjoo Kim, Stony Brook University
 The dual Lagrangian fibration of compact hyperKahler manifolds
 09/15/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Laure Flapan (flapanla@msu.edu)
A compact hyperKahler manifold is a higher dimensional generalization of a K3 surface. An elliptic fibration of a K3 surface correspondingly generalizes into the socalled Lagrangian fibration of a compact hyperKahler manifold. It is known that an elliptic fibration of a K3 surface is always "selfdual" in a certain sense. This turns out to be not the case for higherdimensional Lagrangian fibrations. In this talk, we will explicitly construct the dual of Lagrangian fibrations of all currently known examples of compact hyperKahler manifolds.
Passcode: MSUALG

29095

Thursday 9/16 2:30 PM

Russell Luke, University of Göttingen

Structured (In)Feasibility: Nonmonotone Operator Splitting in Nonlinear Spaces
 Russell Luke, University of Göttingen
 Structured (In)Feasibility: Nonmonotone Operator Splitting in Nonlinear Spaces
 09/16/2021
 2:30 PM  3:30 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
The success of operator splitting techniques for convex optimization has led to an explosion of methods for solving largescale and nonconvex optimization problems via convex relaxation. This success is at the cost of overlooking direct approaches to operator splitting that embrace some of the more inconvenient aspects of many model problems, namely nonconvexity, nonsmoothness and infeasibility. I will introduce some of the tools we have developed for handling these issues, and present sketches of the basic results we can obtain. The formalism is in general metric spaces, but most applications have their basis in Euclidean spaces. Along the way I will try to point out connections to other areas of intense interest, such as optimal mass transport.

29118

Friday 9/17 3:00 PM

Joshua Ruiter, MSU

Algebraic rings
Building on what we discussed last week, I'll talk about how to associate an algebraic ring to an abstract representation of a special unitary group.

29131

Tuesday 9/21 11:10 AM

Matthew Lorentz, Michigan State University

Derivations and the Hochschild Cohomology of Uniform Roe Algebras, Part 2
 Matthew Lorentz, Michigan State University
 Derivations and the Hochschild Cohomology of Uniform Roe Algebras, Part 2
 09/21/2021
 11:10 AM  12:00 PM
 C304 Wells Hall
 Brent Nelson (banelson@msu.edu)
In this series of talks we show a necessary and sufficient condition for the vanishing of the Hochschild cohomology of a uniform Roe algebra. Specifically, the ndimensional continuous Hochschild cohomology vanishes if and only if every norm continuous nlinear map from the uniform Roe algebra to itself is equivalent to a weakly continuous nlinear map.
In our second talk we will continue discussing derivations as they are an important building block of Hochschild cohomology. Motivated by the needs of mathematical physics and the study of oneparameter automorphism groups, it is interesting to study whether all derivations are inner (i.e. given by the commutator bracket) for a particular C*algebra. In the 1970s, a complete solution to this problem was obtained in the separable case via the work of several authors. For nonseparable C*algebras the picture is murkier. Our main goal in this talk is to give a new class of examples that only have inner derivations: uniform Roe algebras, which are separable only in the trivial finite dimensional case. Uniform Roe algebras were originally introduced for indextheoretic purposes but are now studied for their own sake as a bridge between C*algebra theory and coarse geometry, as well as having interesting applications to single operator theory. We will then briefly explain how the uniform Roe algebra only having inner derivations is equivalent to the first Hochschild cohomology vanishing. Lastly, we will discuss the Hochschild cohomology in higher dimensions.

29123

Wednesday 9/22 3:00 PM

Einar Steingrímsson, University of Strathclyde

Permutation statistics and moment sequences
 Einar Steingrímsson, University of Strathclyde
 Permutation statistics and moment sequences
 09/22/2021
 3:00 PM  3:50 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Bruce E Sagan (bsagan@msu.edu)
Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, as a continued fraction, for a 14parameter family of integer sequences and interpret these in terms of statistics on permutations and other combinatorial objects. Special cases include several classical and noncommutative probability laws, and a substantial subset of the orthogonalizing measures in the qAskey scheme of orthogonal polynomials.
This continued fraction captures a variety of combinatorial sequences. In particular, it characterizes the moment sequences associated to the numbers of permutations avoiding (classical and vincular) patterns of length three. This connection between pattern avoidance and classical and noncommutative probability is among several consequences that generalize and unify previous results in the literature.
The fourteen combinatorial statistics further generalize to colored permutations, and, as an infinite family of statistics, to the karrangements: permutations with kcolored fixed points, introduced here. This is joint work with Natasha Blitvić, Lancaster University.

29122

Wednesday 9/22 4:00 PM

Ruoyu Wang , Northwestern

Boundary Stabilisation of Waves on Product Manifolds
 Ruoyu Wang , Northwestern
 Boundary Stabilisation of Waves on Product Manifolds
 09/22/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Dapeng Zhan (zhan@msu.edu)
Take a square and consider the damped waves with boundary damping $a>0$ on the top side only. We will discuss my recent result implying that the energy of those waves must uniformly decay no faster than $t^{1/2}$, and no slower than it. We will also discuss this result in the context of product manifolds where the transverse geometric control is sufficient but not necessary for such energy decay.
Zoom passcode: A*****P**

29096

Thursday 9/23 2:30 PM

Joel Tropp, California Institute of Technology

Scalable semidefinite programming
 Joel Tropp, California Institute of Technology
 Scalable semidefinite programming
 09/23/2021
 2:30 PM  3:30 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This talk describes a provably correct randomized algorithm for solving large, weakly constrained SDP problems by economizing on the storage and arithmetic costs. Numerical evidence shows that the method is effective for a range of applications, including relaxations of MaxCut, abstract phase retrieval, and quadratic assignment problems. Running on a laptop equivalent, the algorithm can handle SDP instances where the matrix variable has over 10^14 entries.
This talk will highlight the ideas behind the algorithm in a streamlined setting. The insights include a careful problem formulation, design of a bespoke optimization method, and use of randomized matrix computations.
Joint work with Alp Yurtsever, Olivier Fercoq, Madeleine Udell, and Volkan Cevher. Based on arXiv 1912.02949 (Scalable SDP, SIMODS 2021) and other papers (SketchyCGM in AISTATS 2017, Nyström sketch in NeurIPS 2017).

29129

Thursday 9/23 3:00 PM

Christopher Potvin, MSU

Hypergraphs & their Homology
 Christopher Potvin, MSU
 Hypergraphs & their Homology
 09/23/2021
 3:00 PM  4:00 PM
 C304 Wells Hall
 Danika Keala Van Niel (vannield@msu.edu)
Hypergraphs are generalizations of both graphs and simplicial complexes. They are often used to represent data for which graphs or simplices do not tell the whole story. As with many data structures, the new hotness is to do TDA (Topological Data Analysis) on hypergraphs. In this talk, I will introduce hypergraphs, why they are useful, and talk about their homology.
https://msu.zoom.us/j/91485321701
Meeting ID: 914 8532 1701
Passcode: SGTS

29130

Friday 9/24 3:00 PM

Jie Yang, MSU

An introduction to Fermat's Last Theorem
 Jie Yang, MSU
 An introduction to Fermat's Last Theorem
 09/24/2021
 3:00 PM  4:00 PM

(Virtual Meeting Link)
 Joshua Ruiter (ruiterj2@msu.edu)
In this talk, I will first introduce some motivations and historical works for FLT, then sketch modern ideas to attack this problem.

29119

Tuesday 9/28 4:00 PM

Peng Zhou, Berkeley

Homological Mirror Symmetry for A_ntype cluster varieties
 Peng Zhou, Berkeley
 Homological Mirror Symmetry for A_ntype cluster varieties
 09/28/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Honghao Gao (gaohongh@msu.edu)
TBA

29097

Thursday 9/30 2:30 PM

Michael Perlmutter, UCLA

Neural Networks on (Directed) Graphs
 Michael Perlmutter, UCLA
 Neural Networks on (Directed) Graphs
 09/30/2021
 2:30 PM  3:30 PM
 Online (virtual meeting)
(Virtual Meeting Link)
The prevalence of graphbased data has spurred the rapid development of graph neural networks (GNNs) and related machine learning algorithms. These methods extend convolutions to graphs either in the spatial domain as a localized averaging operator or in the spectral domain via the eigendecomposition of a suitable Laplacian. However, most popular GNNs have two limitations. i) The filters used in these networks are essentially lowpass filters (i.e. averaging operators). This leads to the so called ``oversmoothing problem'' and the loss of highfrequency information. ii) If the graph is directed, as is the case in many applications including citation, website, and traffic networks, these networks are unable to effectively encode directional information. In this talk, discuss how we can overcome these limitations via i) the graph scattering transform, which uses bandpass filters rather than lowpass, and ii) MagNet, a network designed for directed graphs based on a complex Hermitian matrix known as the magnetic Laplacian.

29105

Tuesday 10/5 4:00 PM

Daniel López Neumann, Indiana University

TBA
 Daniel López Neumann, Indiana University
 TBA
 10/05/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Honghao Gao (gaohongh@msu.edu)
TBA

29137

Wednesday 10/6 3:00 PM

Richard A. Brualdi, University of Wisconsin  Madison

About Permutation Matrices
 Richard A. Brualdi, University of Wisconsin  Madison
 About Permutation Matrices
 10/06/2021
 3:00 PM  3:50 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Bruce E Sagan (bsagan@msu.edu)
The study of permutations is both ancient and modern. They can be viewed as the integers $1,2,\ldots,n$ in some order or as $n\times n$ permutation matrices. They can be regarded as data which is to be sorted. The explicit definition of the determinant uses permutations. An inversion of a permutation occurs when a larger integer precedes a smaller integer. Inversions can be used to define two partial orders on permutations, one weaker than the other. Partial orders have a unique minimal completion to a lattice, the DedekindMacNeille completion. Generalizations of permutation matrices determine related matrix classes, for instance, alternating sign matrices (ASMs) which arose independently in the mathematics and physics literature. Permutations may contain certain patterns, e.g. three integers in increasing order; avoiding such patterns determines certain permutation classes. Similar restrictions can be placed more generally on $(0,1)$matrices. The convex hull of $n\times n$ permutation matrices is the polytope of $n\times n$ doubly stochastic matrices. In a similar way we get ASM polytopes. We shall explore these and other ideas and their connections.

29138

Wednesday 10/6 4:00 PM

Shiva Chidambaram, MIT

TBA
 Shiva Chidambaram, MIT
 TBA
 10/06/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
 Preston Wake (wakepres@msu.edu)
No abstract available.

29132

Thursday 10/7 4:30 AM

Afonso Bandeira, ETHZ  Swiss Federal Institute of Technology Zürich

TBA
 Afonso Bandeira, ETHZ  Swiss Federal Institute of Technology Zürich
 TBA
 10/07/2021
 4:30 AM  5:30 AM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
TBA

29113

Tuesday 10/12 4:00 PM

Ka Ho Wong, Texas A&M University

TBA
 Ka Ho Wong, Texas A&M University
 TBA
 10/12/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Honghao Gao (gaohongh@msu.edu)
TBA

29133

Thursday 10/14 2:30 PM

Edgar Dobriban, University of Pennsylvania

TBA
 Edgar Dobriban, University of Pennsylvania
 TBA
 10/14/2021
 2:30 PM  3:30 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
TBA

29112

Tuesday 10/19 4:00 PM

Francis Bonahon, USC

TBA

29134

Thursday 10/21 4:30 AM

Bubacarr Bah, African Institute for Mathematical Sciences South Africa

TBA
 Bubacarr Bah, African Institute for Mathematical Sciences South Africa
 TBA
 10/21/2021
 4:30 AM  5:30 AM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
TBA

29108

Tuesday 10/26 4:00 PM

Break day, no talk

TBA
 Break day, no talk
 TBA
 10/26/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
 Honghao Gao (gaohongh@msu.edu)
TBA

29127

Wednesday 10/27 4:00 PM

Eoin Mackall, University of Maryland

TBA
 Eoin Mackall, University of Maryland
 TBA
 10/27/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
 Igor Rapinchuk (rapinchu@msu.edu)
No abstract available.

29135

Thursday 10/28 2:30 PM

Rongrong Wang, Michigan State University

TBA
 Rongrong Wang, Michigan State University
 TBA
 10/28/2021
 2:30 PM  3:30 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
TBA

29106

Tuesday 11/2 4:00 PM

James Hughes, UC Davis

TBA

29125

Wednesday 11/3 4:00 PM

Xin Sun, University of Pennsylvania

TBD
 Xin Sun, University of Pennsylvania
 TBD
 11/03/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Dapeng Zhan (zhan@msu.edu)
TBD

29136

Thursday 11/4 2:30 PM

Weilin Li, New York University

TBA
 Weilin Li, New York University
 TBA
 11/04/2021
 2:30 PM  3:30 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Olga Turanova (turanova@msu.edu)
TBA

29111

Tuesday 11/9 4:00 PM

Mike Wong, Dartmouth

TBA

29128

Wednesday 11/10 4:00 PM

Rong Zhou, Cambridge

TBA
 Rong Zhou, Cambridge
 TBA
 11/10/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
 Preston Wake (wakepres@msu.edu)
No abstract available.

29117

Tuesday 11/16 4:00 PM

Anastasiia Tsvietkova, Rutgers

TBA
 Anastasiia Tsvietkova, Rutgers
 TBA
 11/16/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Honghao Gao (gaohongh@msu.edu)
TBA

29121

Wednesday 11/17 4:00 PM

Katrina Honigs, Simon Fraser University

TBA
 Katrina Honigs, Simon Fraser University
 TBA
 11/17/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
 Igor Rapinchuk (rapinchu@msu.edu)
No abstract available.

29124

Tuesday 11/23 4:00 PM

Vijay Higgins, MSU

TBA

29109

Wednesday 12/1 4:00 PM

Jack Petok, Dartmouth

TBA
 Jack Petok, Dartmouth
 TBA
 12/01/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
 Laure Flapan (flapanla@msu.edu)
TBA

29116

Wednesday 12/8 4:00 PM

Salim Tayou, Harvard University

TBA
 Salim Tayou, Harvard University
 TBA
 12/08/2021
 4:00 PM  5:00 PM
 C304 Wells Hall
 Francois Greer (greerfra@msu.edu)
No abstract available.

29115

Tuesday 12/14 4:00 PM

YuShen Lin, Boston University

TBA
 YuShen Lin, Boston University
 TBA
 12/14/2021
 4:00 PM  5:00 PM
 Online (virtual meeting)
(Virtual Meeting Link)
 Honghao Gao (gaohongh@msu.edu)
TBA

29126

Wednesday 12/15 3:00 PM

Olivier Martin, Stony Brook University

TBA
 Olivier Martin, Stony Brook University
 TBA
 12/15/2021
 3:00 PM  4:00 PM
 C304 Wells Hall
 Francois Greer (greerfra@msu.edu)
No abstract available.
