Georgia Institute of Technology School of Mathematics | Georgia Institute of Technology | Atlanta, GA

A graph $H$ is $k$-common if the number of monochromatic copies of $H$ in a $k$-edge-coloring of $K_n$ is asymptotically minimized by a random coloring. For every $k$, we construct a connected non-bipartite $k$-common graph. This resolves a problem raised by Jagger, Stovicek and Thomason. We also show that a graph $H$ is $k$-common for every $k$ if and only if $H$ is Sidorenko and that $H$ is locally $k$-common for every $k$ if and only if H is locally Sidorenko.

Organismal development is a complex process, involving a vast number of molecular constituents interacting on multiple spatio-temporal scales in the formation of intricate body structures. Despite this complexity, development is remarkably reproducible and displays tolerance to both genetic and environmental perturbations. This robustness implies the existence of hidden simplicities in developmental programs. Here, using the Drosophila wing as a model system, we develop a new quantitative strategy that enables a robust description of biologically salient phenotypic variation. Analyzing natural phenotypic variation across a highly outbred population, and variation generated by weak perturbations in genetic and environmental conditions, we observe a highly constrained set of wing phenotypes. Remarkably, the phenotypic variants can be described by a single integrated mode that corresponds to a non-intuitive combination of structural variations across the wing. This work demonstrates the presence of constraints that funnel environmental inputs and genetic variation into phenotypes stretched along a single axis in morphological space. Our results provide quantitative insights into the nature of robustness in complex forms while yet accommodating the potential for evolutionary variations. Methodologically, we introduce a general strategy for finding such invariances in other developmental contexts. -- https://www.biorxiv.org/content/10.1101/2020.10.13.333740v3

Meeting Link: https://gatech.bluejeans.com/348270750

Two of the most famous families of polynomials in combinatorics are Macdonald polynomials and Schubert polynomials. Macdonald polynomials are a family of orthogonal symmetric polynomials which generalize Schur and Hall-Littlewood polynomials and are connected to the Hilbert scheme.  Schubert polynomials also generalize Schur polynomials, and represent cohomology classes of Schubert varieties in the flag variety. Meanwhile, the asymmetric exclusion process (ASEP) is a model of particles hopping on a one-dimensional lattice, which was initially introduced by Macdonald-Gibbs-Pipkin to provide a model for translation in protein synthesis.  In my talk I will explain how two different variants of the ASEP have stationary distributions which are closely connected to Macdonald polynomials and Schubert polynomials, respectively.  This leads to new formulas and new conjectures.

This talk is based on joint work with Corteel-Mandelshtam, and joint work with Donghyun Kim.

Following the approach of Nabutovsky and Rotman for the curve-shortening flow on geodesic nets, we'll show that the shortest closed geodesic on a 2-sphere with non-negative curvature has length bounded above by three times the diameter. On the pinched curvature setting, we prove a bound on the first eigenvalue of the Laplacian and use it to prove a new isoperimetric inequality for pinched 2-spheres sufficiently close to being round. This allows us to improve our bound on the length of the shortest closed geodesic in the pinched curvature setting. This is joint work with Ian Adelstein.