we consider the mixed-strategy zero-sum game such that each player’s objective function is quadratic in its own variables. by considering each player’s value function and duality, the bi-quadratic games are reformulated as linear programs over the cone of copositive (cop) and completely positive (cp) matrices. we apply moment and sos relaxations for the conic constraints of cp and cop matrices, respectively, and obtain a hierarchy of semidefinite relaxations. under certain conditions, the finite convergence for this hierarchy is guaranteed, and the tightness can be checked via flat truncation. we present numerical experiments to show the effectiveness of our approach.

let $g\stackrel{\alpha}{\curvearrowright}(m,\tau)$ be a trace-preserving action of a finite group $g$ on a tracial von neumann algebra. suppose that $a \subset m$ is a finitely generated unital $*$-subalgebra which is globally invariant under $\alpha$. we give a formula relating the von neumann dimension of the space of derivations on $a$ valued on its coarse bimodule to the von neumann dimension of the space of derivations on $a \rtimes^{\text{alg}}_\alpha g$ valued on its coarse bimodule, which is reminiscent of schreier's formula for finite index subgroups of free groups. this formula induces a formula for $\dim \text{der}_c(a,\tau)$ (defined by shlyakhtenko) and under the assumption that $g$ is abelian we obtain the formula for $\delta$ (defined by connes and shlyakhtenko). these quantities and the free entropy dimension quantities agree on a large class of examples, and so by combining these results with known inequalities, one can expand the family of examples for which the quantities agree.

we study stochastic interacting particle methods with and without field coupling for high dimensional concentration and singularity formation phenomena. in case of entropy production of reverse-time diffusion processes, the method computes concentrated invariant measures mesh-free up to dimension 16 at a linear complexity rate based on solving a principal eigenvalue problem of non-self-adjoint advection-diffusion operators. in case of fully parabolic chemotaxis nonlinear dynamics in 3d, the method captures critical mass for finite time singularity formation and blowup time at low costs through a smoother field without relying on self-similarity.

the talk will cover two new developments in our work on efficient high-order methods for conservation laws: (1) a simple stabilization technique for spectral element methods, which uses continuous solution spaces and is provably convergent for linear problems at arbitrary orders of accuracy. the main motivation for the new scheme is its lower cost, which comes from having fewer degrees of freedom, no riemann solvers, and a line-based sparsity pattern. however, it also has other attractive properties such as an improved cfl condition and allowing for other solvers including static condensation. (2) a deep reinforcement learning approach for generation of meshes with optimal connectivities. starting from a delaunay mesh, we formulate the mesh optimization process as a "game" where the moves are standard topological element operations, and the goal is to maximize the number of regular nodes. the agent is trained in a self-play framework using the proximal policy optimization (ppo) algorithm running on gpus. our approach works for 2d triangular and quadrilateral meshes with minimal modification, and it routinely produces close-to-perfect meshes.

inspired by the classical random graph process introduced by erdos and renyi in 1960, we discuss two analogous processes for random representable matroids, one introduced by kelly and oxley in 1982 and the other one introduced by cooper, frieze and pegden in 2019. in the talk we address the evolution of the rank, circuits, connectivity, and the critical number (corresponding to the logarithm of the chromatic number of graphs) of the first random matroid, and then we focus on the minors in both matroid models. 

this talk discusses the challenging problem of finding global optimal solutions for two-stage stochastic programs with continuous decision variables and nonconvex recourse functions. we introduce a two-phase approach, which does not only generate global lower bounds for the nonconvex stochastic program but also simplifies the computation of the expected value of the recourse function by using moments of random vectors. this makes our overall algorithm particularly suitable for the case where the random vector follows a continuous distribution or when dealing with many scenarios. numerical experiments are given to demonstrate the effectiveness of our proposed approach.

we will consider the behavior of the kolmogorov-sinai entropies of amenable group actions under a shannon orbit equivalence. although dynamical entropy is in general not invariant under orbit equivalences, recent works have shown that various notions of restricted orbit equivalences will preserve entropy. we focus on the case where the orbit equivalence is shannon, and both groups are finitely generated amenable. in this talk, we will present a proof for our main result.

as the shortest path metric on a weighted tree can be embedded isometrically into a finite $\ell_1$ space, a lipschitz embedding of a given graph into $\ell_1$ can be obtained by constructing a low distortion embedding into a tree. conversely, while there are various topological properties of graphs that guarantee controlled distortion lipschitz embeddings into $\ell_1$ ($k$-outerplanar, series-parallel, low euler characteristic), it is still often the case that such a graph embeds quite poorly into a tree.

by introducing the notion of a stochastic embedding into a family of trees one can find more general concrete embeddings into $\ell_1$ then those limited by a single tree. in fact, it is known that every graph with n vertices embeds stochastically into trees with distortion o(log(n)). nevertheless, this upper bound is sharp for graphs such as expanders, grids and, by a recent joint work with schlumprecht, a large class of "fractal-like" series-parallel graphs called slash powers. 

in this talk we introduce an equivalent characterization of stochastic distortion called expected distortion and after proving a mild extension of a result of gupta regarding poor tree embeddings of a cycle, inductively lower bound the expected distortion of generalized laakso graphs found in most nontrivial slash power families.

given an automorphism of a variety $x$, there is an induced ''natural'' automorphism on $x^{[n]}$, the hilbert scheme of $n$ points of $x$. while unnatural automorphisms of $x^{[n]}$ are known to exist for certain varieties $x$ and integers $n$, all previously known examples could be shown to be unnatural because they do not preserve multiplicities. belmans, oberdieck, and rennemo thus asked if an automorphism of a hilbert scheme of points of a surface is natural if and only if it preserves the diagonal of non-reduced subschemes.

we give an answer in the negative for all $n\ge 2$ by constructing explicit counterexamples on certain abelian surfaces $x$. these surfaces are not generic, and hence we prove a partial converse statement that all automorphisms of the hilbert scheme of two points on a very general abelian surface are natural for certain polarization types (including the principally polarized case).

we will discuss questions surrounding automorphic l-functions, particularly deligne’s conjecture about critical values of motivic l-functions. in particular, we study the adjoint l-function of u(2,1).

hundley showed that a certain integral, involving an eisenstein series on the exceptional group g_2, computes this l-function at unramified places. we discuss the computation of this integral at the archimedean place for quaternionic modular forms, and how this relates to deligne's
conjecture.

when trying to solve partial differential equations, a common practice is to enlarge the space of possible solutions to the class of non-differentiable functions, where it is easier to find “weak” solutions (i.e. potentially very irregular). as we are usually interested in “strong” solutions (i.e very regular), one is then confronted with the following problem: how do we upgrade the regularity? a fundamental tool in these situations is a monotonicity formula, an object that allows to study the infinitesimal behavior of solutions of pdes by reducing it to a classification problem. more concretely, a monotonicity formula is an identity implying that a certain quantity related to the problem at hand is monotone, or conserved. i will try to convey the gist of this idea that has found applications in many areas at the intersection of geometry and analysis, e.g. harmonic maps, minimal surfaces, free boundary problems, yang-mills connections to name just a few. i will try to maintain the level of analysis needed at a minimum, you only need to remember that the first derivative of a smooth function at an interior minimum is zero. i will explain the rest. 

mean field games are played by populations of competing agents who derive their update rules by comparing their own state variable with that of the mean field. after a brief introduction to several areas where they have been used recently, we will focus on models of competing tumor cell populations based on the replicator dynamics mean field evolutionary game with prisoner’s dilemma payoff matrix. we use optimal and adaptive control theory on both deterministic and stochastic versions of these models to design multi-drug chemotherapy schedules that suppress the competitive release of resistant cell populations (to avoid chemo-resistance) by maximizing the shannon diversity of the competing subpopulations. the models can be extended to networks where spatial connectivity can influence optimal chemotherapy scheduling.