University of Washington

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...

Measures provide valuable insights into long-term and global behaviors across a broad range of dynamical systems. In this talk, we present our recent research efforts that employ measure theory and optimal transport to tackle core challenges in...

Given a parabolic subgroup W I of a Coxeter system ( W , S ) , the set of left cosets w W I , for I ⊆ S , w ∈ W , is well-studied. However, the set of double cosets I , J ⊆ S for I , J ⊆ S is a less studied object. I want to analyze the double cosets...

The generalized degree polynomial (GDP) of a tree is an invariant introduced by Crew that enumerates subsets of vertices by size and number of internal and boundary edges. Aliste-Prieto et al. proved that the chromatic symmetric function of a tree...

The framework of mirror symmetry, originally discovered by string theorists, asserts that geometric objects come in "mirror pairs" (X,Y), where the enumerative geometry (e.g. quantum cohomology) of X controls the complex geometry of the mirror dual Y...

There is a rich history of domino tilings in two dimensions. Through a variety of techniques we can answer questions such as: how many tilings are there of a given region or what does a random tiling look like? These questions and their answers...

We invite talented and motivated graduate students from Canada and the United States to participate in a unique Summer School and Hackathon. The goal of this event is to expose graduate students to the exciting and emergent field of Structured...

We generalize a result about the face numbers of polytopes to the realm of CW spheres. Let X be a CW sphere such that: X is strongly regular. (The intersection of any two faces is a face.) X is shellable. (We can build X, facet by facet, so that each...

An unweighted graph is conformally rigid if allowing nonnegative edge weights will not increase the second eigenvalue, or decrease the largest eigenvalue, of its Laplacian matrix. There are natural motivations for finding weights on a graph that...