University of Cambridge

TBA

Active solids consume energy to allow for actuation and shape change not possible in equilibrium. I will first introduce active solids in comparison with their active fluid counterparts. I will then focus on active solids composed of non-reciprocal springs and show how so-called odd elastic moduli arise in these materials. Odd active solids have counter-intuitive elastic properties and require new design principles for optimal response. For example, in floppy lattices, zero modes couple to microscopic non-reciprocity, which destroys odd moduli entirely in a phenomenon reminiscent of rigidity percolation. Instead, an optimal odd lattice will be sufficiently soft to activate elastic deformations, but not too soft. These results provide a theoretical underpinning for recent experiments and point to the design of novel soft machines.

We investigate an interacting particle model to simulate a foraging colony of ants, where each ant is represented as a so-called active Brownian particle. Interactions among ants are mediated through chemotaxis, aligning their orientations with the upward gradient of the pheromone field. We show how the empirical measure of the interacting particle system converges to a solution of a mean-field limit (MFL) PDE for some subset of the model parameters. We situate the MFL PDE as a non-gradient flow continuity equation with some other recent examples. We then demonstrate that the MFL PDE for the ant model has two distinctive behaviors: the well-known Keller--Segel aggregation into spots and the formation of lanes along which the ants travel. Using linear and nonlinear analysis and numerical methods we provide the foundations for understanding these particle behaviors at the mean-field level. We conclude with long-time estimates that imply that there is no infinite time blow-up for the MFL PDE.

A zero-one matrix $M$ is said to contain another zero-one matrix $A$ if we can delete some rows and columns of $M$ and replace some 1-entries with 0-entries such that the resulting matrix is $A$. The extremal number of $A$, denoted $\operatorname{ex}(n,A)$, is the maximum number of 1-entries that an $n\times n$ zero-one matrix can have without containing $A$. The systematic study of this function for various patterns $A$ goes back to the work of Furedi and Hajnal from 1992, and the field has many connections to other areas of mathematics and theoretical computer science. The problem has been particularly extensively studied for so-called acyclic matrices, but very little is known about the general case (that is, the case where $A$ is not necessarily acyclic). We prove the first asymptotically tight general result by showing that if $A$ has at most $t$ 1-entries in every row, then $\operatorname{ex}(n,A)\leq n^{2-1/t+o(1)}$. This verifies a conjecture of Methuku and Tomon.

Our result also provides the first tight general bound for the extremal number of vertex-ordered graphs with interval chromatic number two, generalizing a celebrated result of Furedi, and Alon, Krivelevich and Sudakov about the (unordered) extremal number of bipartite graphs with maximum degree $t$ in one of the vertex classes.

Joint work with Barnabas Janzer, Van Magnan and Abhishek Methuku.