University of Washington

Influential work of Hodge from the 1940s led the way in using Gröbner bases to combinatorially study the Grassmannian. In this talk, we will follow Hodge's approach in order to investigate certain subvarieties called positroid varieties. Positroid...

In a seminal paper, Kannan and Lovász (1988) considered a quantity µ K L ( Λ , K ) which denotes the best volume-based lower bound on the covering radius µ ( Λ , K ) of a convex body K with respect to a lattice Λ . Kannan and Lovász proved that µ ( Λ...

TBA

The study of surface gravity waves is crucial for understanding the formation of rogue waves and whitecaps in ocean swell. Waves originating from the epicenter of a storm can often be approximated as unidirectional. In this presentation, we will...

The computer is taking over. AND, in many branches of applied mathematics and statistics we hear 'why bother to prove theorems? simulations and numerical approximation are easier and better for real problems'. NOT SO FAST; I will present a collection...

Optimal transport operates on empirical distributions which may contain acquisition artifacts, such as outliers or noise, thereby hindering a robust calculation of the OT map. Additionally, it necessitates equal mass between the two distributions...

We consider the problem of minimizing a convex function under convex constraints, where some or all of the decision variables are constrained to be integer, with access to first-order oracles for the objective function and separation oracles for the...

One way to define an integer polymatroid ρ is via its independent set polytope, whose faces are parallel translations of the independent set polytopes of the minors of ρ. To better understand the interior of this polytope, we endow a structure on...

In this talk, we consider colored permutation groups ℤm≀Sn, which contain the symmetric groups Sn≅ℤ1≀Sn and the signed symmetric groups Bn≅ℤ2≀Sn as special cases. Like in Sn, colored permutations in ℤm≀Sn have a notion of cycle type that classifies...

A d-polytope is called (d−i)-simplicial if all of its (d−i)-faces are simplices. It is i-simple if every (d−i−1)-face belongs to exactly i+1 facets. A few low-dimensional examples of (d−i)-simplicial i-simple polytopes arising from regular polytopes...