Georgia Institute of Technology College of Sciences

In this talk, we'll sketch how one might hope to construct spaces (or spectra) from Floer theories, including framed flow categories and finite-dimensional approximation.  If time allows, we'll talk about some questions Floer spaces (or spectra) can be useful for.

Large-scale parallel-processing infrastructures such as data centers and cloud networks form the cornerstone of the modern digital environment. Central to their efficiency are resource management policies, especially load balancing algorithms (LBAs), which are crucial for meeting stringent delay requirements of tasks. A contemporary challenge in designing LBAs for today's data centers is navigating data locality constraints that dictate which tasks are assigned to which servers. These constraints can be naturally modeled as a bipartite graph between servers and various task types. Most LBA heuristics lean on the mean-field approximation's accuracy. However, the non-exchangeability among servers induced by the data locality invalidates this mean-field framework, causing real-world system behaviors to significantly diverge from theoretical predictions. From a foundational standpoint, advancing our understanding in this domain demands the study of stochastic processes on large graphs, thus needing fundamental advancements in classical analytical tools.

In this presentation, we will delve into recent advancements made in extending the accuracy of mean-field approximation for a broad class of graphs. In particular, we will talk about how to design resource-efficient, asymptotically optimal data locality constraints and how the system behavior changes fundamentally, depending on whether the above bipartite graph is an expander, a spatial graph, or is inhomogeneous in nature.

 A graph is called k-critical if its chromatic number is k but any proper subgraph has chromatic number less than k. There have been extensive reseaches on k-critical graphs over the past decades, yet several basic problems remain widely open. One of such problems is to determine the maximum number of edges in an n-vertex k-critical graph. In this talk, we will discuss some recent results on extremal aspects of k-critical graphs, including improvments on the extremal number of edges/cliques/critical subgraphs in k-critical graphs.  This is based on some joint works with Jun Gao, Cong Luo and Tianchi Yang. 

In 1964, Horrocks proved that a vector bundle on a projective space splits as a sum of line bundles if and only if it has no intermediate cohomology. Generalizations of this criterion, under additional hypotheses, have been proven for other toric varieties, for instance by Eisenbud-Erman-Schreyer for products of projective spaces, by Schreyer for Segre-Veronese varieties, and Ottaviani for Grassmannians and quadrics. This talk is about a splitting criterion for arbitrary smooth projective toric varieties, as well as an algorithm for finding indecomposable summands of sheaves and modules in the more general setting of Mori dream spaces.