University of Washington

Let K be a convex body made of material of uniform density less than 1 submerged into water of density 1. How to find the directions of equilibrium of $K$? How many directions of equilibrium does a triangular prism have? (A direction n orthogonal to...

Let Mat n × n ( C ) be the affine space of n × n complex matrices with coordinate ring C [ x n × n ] . We define graded quotients of C [ x n × n ] where each quotient ring carries a group action. These quotient rings are obtained by applying the...

For many optimization problems, we lack time-efficient algorithms; in many cases this is true even for "average-case" inputs from simple data models. To what extent can tools for complexity theory be adapted to this average-case setting? In this talk...

Schubert polynomials concretely embody the remarkable connection between the geometry of the flag variety G L ( n ) / B and the combinatorics of the symmetric group. This talk will develop similar story for the forest polynomials recently introduced...

Locally gentle algebras are a class of infinite-dimensional, non-connected algebras which have nice combinatorial interpretation in terms of quivers with relations. These relations ensure that each arrow is contained in a unique maximal path. In this...

Homology and cohomology are powerful invariants: while easy to compute, they contain rich information about spaces, the geometry of manifolds, vector bundles, and more. (Co)homology satisfies a list of axioms which are easy to generalize. The best...

Sharon and Joerg are members of the Boeing Applied Mathematics organization. They partner with business units to develop applied math solutions and tools that help Boeing reduce costs, improve products and operations. In this presentation, Sharon and...

Talk titles and abstracts: Natasha Crepeau: Constructing stability conditions from triangulations of Lawrence polytopes Abstract: A stability condition of a graph G is a collection of generalized break divisors of size | ST ( G ) | . In this talk, we...

We consider an online strategic classification problem where each arriving agent can manipulate their true feature vector to obtain a positive predicted label while incurring a cost that depends on the amount of manipulation. The learner seeks to...

In this talk, we will discuss the question of establishing CLTs for empirical entropic optimal transport when choosing the regularisation parameter as a decreasing function of the sample size. Importantly, decreasing the regularisation parameter...